Similarity searching: Towards bulk-loading peer-to-peer networks

Proceedings - First International Workshop on Similarity Search and Applications, SISAP 2008

Volumn , Issue , 2008, Pages 87-94

  Dohnal, Vlastislav ^a   Sedmidubský, Jan ^a   Zezula, Pavel ^a   Novák, David ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED STRUCTURE; METRIC DATA;

DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION MANAGEMENT; MATHEMATICAL MODELS; PROBLEM SOLVING;

ONLINE SEARCHING;

EID: 44249121534     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SISAP.2008.9     Document Type: Conference Paper

References (30)

1. L. Arge, M. de Berg, H. J. Haverkort, and K. Yi. The priority r-tree: a practically efficient and worst-case optimal r-tree. In Proceedings of the ACM SIGMOD International Conference on Management of data (SIGMOD 2004), pages 347-358, New York, NY, USA, 2004. ACM.
2. F. Banaei-Kashani and C. Shahabi. SWAM: A family of access methods for similarity-search in peer-to-peer data networks. In Proceedings of the Thirteenth ACM conference on Information and Knowledge Management (CIKM 2004), pages 304-313. ACM Press, 2004.
3. M. Batko, D. Novak, F. Falchi, and P. Zezula. On scalability of the similarity search in the world of peers. In Proceedings of First International Conference on Scalable Information Systems (INFOSCALE 2006), Hong Kong, May 30 - June 1, pages 1-12. ACM Press, 2006.
4. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. MINERVA: Collaborative P2P search. In Proceedings of the 31st international conference on Very large data bases (VLDB 2005), pages 1263-1266. VLDB Endowment, 2005.
5. S. Berchtold, C. Böhm, and H.-P. Kriegel. Improving the query performance of high-dimensional index structures by bulk-load operations. In Proceedings of the 6th International Conference on Extending Database Technology (EDBT 1998), pages 216-230, London, UK, 1998. Springer-Verlag.
6. S. Brin. Near neighbor search in large metric spaces. In U. Dayal, P. M. D. Gray, and S. Nishio, editors, Proceedings of the 21th International Conference on Very Large Data Bases (VLDB 1995), Zurich, Switzerland, September 11-15, 1995, pages 574-584. Morgan Kaufmann, 1995.
7. P. Ciaccia and M. Patella. Bulk loading the M-tree. In Proceedings of the 9th Australasian Database Conference (ADC 1998), Perth, Australia, February 2-3, 1998, volume 20(2) of Australian Computer Science Communications, pages 15-26. Springer, 1998.
8. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB 1997), Athens, Greece, August 25-29, 1997, pages 426-435. Morgan Kaufmann, 1997.
9. J. V. den Bercken and B. Seeger. An evaluation of generic bulk loading techniques. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB 2001), pages 461-470, San Francisco, CA, USA, 2001. Morgan Kaufmann Publishers Inc.
10. J. V. den Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In Proceedings of the 23rd International Conference on Very Large. Data Bases (VLDB 1997), pages 406-415, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc.
11. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. D-Index: Distance searching index for metric data sets. Multimedia Tools and Applications, 21(1):9-33, 2003.
12. F. Falchi, C. Gennaro, and P. Zezula. A content-addressable network for similarity search in metric spaces. In Proceedings of the the 2nd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2005), Trondheim, Norway, August 28-29, 2005, pages 126-137, 2005.
13. P. Ganesan, B. Yang, and H. Garcia-Molina. One torus to rule them all: Multi-dimensional queries in P2P systems. In Proceedings of the 7th International Workshop on the Web and Databases (WebDB 2004), pages 19-24, New York, NY, USA 2004. ACM Press.
14. T. M. Ghanem, R. Shah, M. F. Mokbel, W. G. Aref, and J. S. Vitter. Bulk operations for space-partitioning trees. In Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), page 29, Washington, DC, USA, 2004. IEEE Computer Society.
15. G. R. Hjaltason and H. Samet. Improved bulk-loading algorithms for quadtrees. In Proceedings of the 7th International Symposium on Advances in Geographic Information Systems (ACM GIS 1999), November 2-6, 1999, Kansas City, USA, pages 110-115. ACM Press, 1999.
16. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems (TODS 2003), 28(4):517-580, 2003.
17. I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree using Fractals. In Proceedings of the 20th International Conference on Very Large Databases (VLDB 1994), pages 500-509, Santiago, Chile, 1994.
18. T. M. Klein, K. J. Parzygnat, and A. L. Tharp. Optimal b-tree packing. Information Systems, 16(2):239-243, 1991.
19. S. T. Leutenegger and D. M. Nicol. Efficient bulk-loading of gridfiles. IEEE Transactions on Knowledge and Data Engineering, 09(3):410-420, 1997.
20. J. Li, D. Rotem, and J. Srivastava. Algorithms for loading parallel grid files. SIGMOD Record, 22(2):347-356, 1993.
21. G. Navarro. Searching in metric spaces by spatial approximation. In Proceedings of the 6th International Symposium on String Processing and Information Retrieval (SPIRE 1999), Cancun, Mexico, September 21-24, 1999, pages 141-148. IEEE Computer Society, 1999.
22. D. Novak and P. Zezula. M-Chord: A scalable distributed similarity search structure. In Proceedings of First International Conference on Scalable Information Systems (INFOSCALE 2006), Hong Kong, May 30 - June 1, pages 1-10. IEEE Computer Society, 2006.
23. M. H. Overmars and J. van Leeuwen. Dynamic multi-dimensional, data structures based on quad- and kd trees. Acta Informatica, 17(3):267-285, 1982.
24. A. Papadopoulos and Y. Manolopoulos. Parallel bulk-loading of spatial data. Parallel Computing, 29(10):1419-1444, 2003.
25. H. Samet. Foundations of Multidimensional And Metric Data Structures. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann, 2006.
26. A. P. Sexton and R. Swinbank. Bulk loading the m-tree to enhance query performance. In M. H. Williams and L. M. MacKinnon, editors, Proceedings of 21st British National Conference on Databases (BNCOD 2004), Edinburgh, UK, July 7-9, 2004, volume 3112 of Lecture Notes in Computer Science, pages 190-202. Springer, 2004.
27. T. Skopal. Pivoting M-tree: A metric access method for efficient similarity search. In V. Snášel, J. Pokorný, and K. Richta, editors, Proceedings of the Annual International Workshop on DAtabases, TExts, Specifications and Objects (DATESO 2004), Desna, Czech Republic, April 14-16, 2004, volume 98 of CEUR Workshop Proceedings. Technical University of Aachen (RWTH), 2004.
28. C. Traina, Jr., A. J. M. Traina, B. Seeger, and C. Faloutsos. Slim-Trees: High performance metric trees minimizing overlap between nodes. In C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, editors, Proceedings of the 7th International Conference on Extending Database Technology (EDBT2000), Konstanz, Germany, March 27-31, 2000, volume 1777 of Lecture Notes in Computer Science, pages 51-65. Springer, 2000.
29. C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In P. M. G. Apers, P. Atzeni, S. Ceri, S. Paraboschi, K. Ramamohanarao, and R. T. Snodgrass, editors, Proceedings of 27th International Conference on Very Large Data Bases (VLDB 2001), Roma, Italy, September 11-14, 2001, pages 421-430. Morgan Kaufmann, 2001.
30. P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity Search: The Metric Space Approach, volume 32 of Advances in Database Systems. Springer, 2005.