DiST: Fully decentralized indexing for querying distributed multidimensional datasets

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Nam, Beomseok ^a   Sussman, Alan ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; QUERY LANGUAGES; RESOURCE ALLOCATION; SERVERS; WIDE AREA NETWORKS;

DATA DISCOVERY; DIST; DISTRIBUTED RESOURCES; PEER-TO-PEER (P2P) SYSTEMS;

INDEXING (OF INFORMATION);

EID: 33847135752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639280     Document Type: Conference Paper

References (20)

1. H. Andrade, S. Aryangat, T. Kurc, J. Saltz, and A. Sussman. Efficient execution of multi-query data analysis batches using compiler optimization strategies. In Proceedings of the 16th Workshop on Languages and Compilers for Parallel Computing, pages 509-523, Oct. 2003.
2. C. Baru, R. Moore, A. Rajasekar, and M. Wan. The SDSC Storage Resource Broker. In Proceedings of CASCON'98 Conference, Dec. 1998.
3. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram. Querying peer-to-peer networks using P-trees. In Proceedings of the 7th International Workshop on the Web and Databases, 2004.
4. K. Czajkowski, S. Fitzgerald, I. Foster, and C. Kesselman. Grid information services for distributed resource sharing. In Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing (HPDC), Aug. 2001.
5. P. Ganesan, B. Yang, and H. Garcia-Molina. One torus to rule them all: Multi-dimensional queries in p2p systems. In WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases, pages 19-24. LNCS, 2004.
6. Gnutella website. http://www.gnutella.org.
7. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD84), pages 47-57, 1984.
8. A. Henrich, H.-W. Six, and P. Widmayer. The LSD tree: Spatial access to multidimensional point and non-point objects. In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB89), pages 45-53, 1989.
9. I. Kamel and C. Faloutsos. Parallel R-trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD92), pages 195-204, 1992.
10. N. Koudas, C. Faloutsos, and I. Kamel. Declustering spatial databases on a multi-computer architecture. In Proceedings of the 5th International Conference on Extending Databases Technology (EDBT), 1996.
11. B. Kroll and P. Widmayer. Distributing a search tree among a growing number of processors. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD94), pages 265-276, 1994.
12. LAM/MPI website. http://www.lam-mpi.org.
13. W. Litwin, M.-A. Neimat, and D. A. Schneider. LH*: Linear hashing for distributed files. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD93), pages 327-336, 1993.
14. B. Nam and A. Sussman. A comparative study of spatial indexing techniques for multidimensional scientific datasets. In Proceedings of 16th International Conference on Scientific and Statistical Database Management (SSDBM), June 2004.
15. B. Nam and A. Sussman. DiST: Fully decentralized indexing for querying distributed multidimensional datasets. Technical Report CS-TR-4720 and UMIACS-TR-2005-28, University of Maryland, 2005.
16. B. Nam and A. Sussman. Spatial indexing of distributed multidimensional datasets. In Proceedings of CCGrid2005: IEEE/ACM International Symposium on Cluster Computing and the Grid, May 2005.
17. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of the 2001 ACM SIGCOMM Conference, 2001.
18. B. Schnitzer and S. T. Leutenegger. Master-Client R-Trees: A new parallel R-tree architecture. In Proceedings of the 11th International Conference on Scientific and Statistical Database Management (SSDBM), pages 6877, 1999.
19. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
20. C. Zhang, A. Krishnamurthy, and R. Y. Wang. SkipIndex: Towards a scalable peer-to-peer index service for high dimensional data. Technical Report TR-703-04, Princeton University, 2004.