Author:
Chovanec Peter,Krátký Michal
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Ailamaki, A., DeWitt, D.J., Hill, M.D., Skounakis, M.: Weaving Relations for Cache Performance. In: Proceedings of the International Conference on Very Large Data Bases, VLDB 2001 (2001)
2. Bayer, R.: The Universal B-Tree for Multidimensional Indexing: General Concepts. In: Masuda, T., Tsukamoto, M., Masunaga, Y. (eds.) WWCA 1997. LNCS, vol. 1274, pp. 198–209. Springer, Heidelberg (1997)
3. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of the ACM International Conference on Management of Data, SIGMOD 1990 (1990)
4. Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: A Multidimensional Workload-Aware Histogram. In: Proceedings of the ACM International Conference on Management of Data, SIGMOD 2001 (2001)
5. Chen, S., Gibbons, P.B., Mowry, T.C.: Improving Index Performance Through Prefetching. In: Proceedings of the ACM International Conference on Management of Data, SIGMOD 2001 (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interval stabbing on the Automata Processor;Journal of Parallel and Distributed Computing;2020-01
2. Processing of Range Query Using SIMD and GPU;Advances in Intelligent Systems and Computing;2013