Metric-temporal access methods

Authors

  • Anabella De Battista Universidad Tecnológica Nacional, Concepción del Uruguay, Entre Ríos, Argentina
  • Norma Edith Herrera Universidad Nacional de San Luis, San Luis, Argentina
  • Gilberto A. Gutiérrez Retamal Facultad de Ciencias Empresariales, Universidad del Bio Bio, Chillán, Chile
  • Andrés Pascal Universidad Tecnológica Nacional, Concepción del Uruguay, Entre Ríos, Argentina

Keywords:

Metric spaces, Temporal databases, Indexes, Metric-temporal databases

Abstract

Metric-temporal databases are a new database model that combines metric spaces with temporal databases to process similarity queries within a time interval or snapshot. The Historical FHQT is a metric-temporal index which has shown to be competitive answering this type of queries. This index store a list of valid snapshots where each one contains an Fixed Height Queries Tree that indexes all objects existing at that instant. In this paper we present an improvement to this access method that consists in using different sets of pivots for the Fixed Height Queries Tree that correspond to consecutive time instants. The experimental results show this modification improves the filtering capacity of the index.

Downloads

Download data is not yet available.

References

[1] R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proc. 5th Combinatorial Pattern Matching (CPM’94), LNCS 807, pages 198–212, 1994.
[2] S. Brin. Near neighbor search in large metric spaces. In Proc. 21st Conference on Very Large Databases (VLDB’95), pages 574–584, 1995.
[3] B. Bustos, G. Navarro, and E. Chávez. Pivot selection techniques for proximity searching in metric spaces. In Proc. of the XXI Conference of the Chilean Computer Science Society (SCCC’01), pages 33–40. IEEE CS Press, 2001.
[4] E. Chávez and K. Figueroa. Faster proximity searching in metric data. In Proceedings of MICAI 2004. LNCS 2972, Springer, Cd. de México, México, 2004.
[5] E. Chávez, J. Marroquín, and G. Navarro. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications (MTAP), 14(2):113–135, 2001.
[6] E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquín. Searching in metric spaces. ACM Computing Surveys, 33(3):273–321, September 2001.
[7] A. De Battista, A. Pascal, G. Gutierrez, and N. Herrera. Búsquedas en bases de datos métricas-temporales. In Actas del VIII Workshop de Investigadores en Ciencias de la Computación, Buenos Aires, Agentina, 2006.
[8] A. De Battista, A. Pascal, G. Gutierrez, and N. Herrera. Un nuevo índice métrico-temporal: el historical-fhqt. In Actas del XIII Congreso Argentino de Ciencias de la Computación, Corrientes, Agentina, 2007.
[9] C. Jensen. A consensus glossary of temporal database concepts. ACM SIGMOD Record, 23(1):52–54, 1994.
[10] G. Navarro. Searching in metric spaces by spatial approximation. In Proc. String Processingand Information Retrieval (SPIRE’99), pages 141–148. IEEE CS Press, 1999.
[11] A. Pascal, A. De Battista, G. Gutierrez, and N. Herrera. Procesamiento de consultas métrico-temporales. In XXIII Conferencia Latinoamericana de Informática, pages 133–144, San José de Costa Rica, 2007.
[12] C. Ruano, E. Chávez, and N. Herrera. Discretización binaria para el ftrie. In Actas del X Congreso Argentino de Ciencias de la Computación (CACIC’04), pages 100–111, Buenos Aires, Argentina, 2004.
[13] B. Salzberg and V. Tsotras. A comparison of access methods for temporal data. ACM Computing Surveys, 31(2), 1999.

Downloads

Published

2010-06-01

Issue

Section

Original Articles

How to Cite

[1]
“Metric-temporal access methods”, JCS&T, vol. 10, no. 02, pp. p. 54–60, Jun. 2010, Accessed: Mar. 06, 2026. [Online]. Available: https://journal.info.unlp.edu.ar/JCST/article/view/727

Similar Articles

1-10 of 58

You may also start an advanced similarity search for this article.