Effective use of space for pivot-based metric indexing structures

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 402-409

  Celik, Cengiz ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; SET THEORY; TECHNOLOGY; TOPOLOGY;

APPROXIMATION FACTORS; CONSTRUCTION COSTS; DATA ENGINEERING; DISCRETIZATION; DISTANCE DISTRIBUTIONS; DISTANCE MATRICES; FLOATING POINT; INDEXING STRUCTURES; INTERNATIONAL CONFERENCES; LARGE DATASETS; METRIC INDEXING STRUCTURES; METRIC SPACE INDEXING; PERFORMANCE TRADE-OFFS; PRIORITIZATION; QUERY COSTS; SPACE CONSUMPTION; SPACE REQUIREMENTS; TREE-BASED METHODS;

INDEXING (OF INFORMATION);

EID: 50249174576     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2008.4498351     Document Type: Conference Paper

References (17)

1. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 357-368, 1997.
2. S. Brin. Near neighbor search in large metric spaces. In The VLDB Journal, pages 574-584, 1995.
3. B. Bustos, G. Navarro, and E. Chavez. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters, 24(14):2357-2366, 2003.
4. J. C. Traina, A. J. M. Traina, R. F. S. Filho, and C. Faloutsos. How to improve the pruning ability of dynamic metric access methods. In CIKM, pages 219-226, 2002.
5. J. C. Traina, A. J. M. Traina, B. Seeger. and C. Faloutsos. Slim-trees: High performance metric trees minimizing overlap between nodes. In Advances in Database Technology - EDBT 2000, 7th International Conference on Extending Database Technology, Konstanz, Germany, March 27-31, 2000, Proceedings, volume 1777 of Lecture Notes in Computer Science, pages 51-65. Springer, 2000.
6. C. Celik. Priority vantage points structures for similarity queries in metric spaces. In Proceedings of EurAsia-ICT, volume 2510 of Lecture Notes in Computer Science, pages 256-263. Springer, 2002.
7. E. Chávez, J. L. Marroquín, and G. Navarro. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools Appl., 14(2): 113-135, 2001.
8. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Searching in metric spaces. ACM Comput. Surv., 33(3):273-321, 2001.
9. P. Ciaccia, M. Patella, and P. Zezula. M-tree: an efficient access method for similarity search in metric spaces. In Pmc. 23rd Conf. on Very Large Databases (VLDB'97), pages 426-435, 1997.
10. K. Figueroa and K. Fredriksson. Simple space-time tradeoffs for aesa. In WEA, pages 229-241, 2007.
11. L. Micó, J. Oncina, and E. Vidal. A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recognition Letters, 15:9-17, 1994.
12. G. Navarro, R. Paredes, and E. Chávez, t-spanners for metric space searching. Data & Knowledge Engineering, 63(3):818-852, 2007.
13. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett., 40(4): 175-179, 1991.
14. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters, 4:145, 1986.
15. E. Vidal. New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (aesa). Pattern Recogn. Lett., 15(1): 1-7, 1994.
16. M. R. Vieira, J. C. Traina, F. J. T. Chino, and A. J. M. Traina. Dbm-tree: A dynamic metric access method sensitive to local density data. In S. Lifschitz, editor, SBBD, pages 163-177. UnB, 2004.
17. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (SODA'93), pages 311-321. SIAM Press, 1993.