Declustering spatial databases on a multi-computer architecture-Reference-Cited by-同舟云学术

Declustering spatial databases on a multi-computer architecture

Published:1996 Issue: Volume: Page:592-614
ISSN:0302-9743
Container-title:Advances in Database Technology — EDBT '96
language:
Short-container-title:

Author:

Koudas Nikos,Faloutsos Christos,Kamel Ibrahim

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0014180

Reference44 articles.

1. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. Proc. of VLDB Conf., pages 487–499, September 1994.

2. D. Ballard and C. Brown. Computer Vision. Prentice Hall, 1982.

3. J.L. Bentley. Multidimensional binary search trees used for associative searching. CACM, 18(9):509–517, September 1975.

4. C. K. Baru, G. Fecteau, A. Goyal, H. Hsiao, A. Jhingran, S. Padmanabhan, G. P. Copeland, and W. G. Wilson. DB2 Parallel Edition. IBM Systems Journal, 32(2):292–322, 1995.

5. Thomas Brinkhoff, Hans-Peter Kriegel, and Bernhard Seeger. Efficient processing of spatial joins using r-trees. Proc. of ACM SIGMOD, pages 237–246, May 1993.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Indexing;Encyclopedia of Big Data Technologies;2022

2. Multi-GPU Efficient Indexing for Maximizing Parallelism of High Dimensional Range Query Services;IEEE Transactions on Services Computing;2021

3. Packing R-trees with Space-filling Curves;ACM Transactions on Database Systems;2020-09-30

4. Indexing;Encyclopedia of Big Data Technologies;2019

5. Multidimensional range queries on modern hardware;Proceedings of the 30th International Conference on Scientific and Statistical Database Management;2018-07-09