Indexing Values in Continuous Field Databases

  • Myoung-Ah Kang
  • Christos Faloutsos
  • Robert Laurini
  • Sylvie Servigne
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2287)

Abstract

With the extension of spatial database applications, during the last years continuous field databases emerge as an important research issue in order to deal with continuous natural phenomena during the last years. A field can be represented by a set of cells containing some explicit measured sample points and by arbitrary interpolation methods used to derive implicit values on nonsampled positions. The form of cells depends on the specific data model in an application. In this paper, we present an efficient indexing method on the value domain in a large field database for field value queries (e.g. finding regions where the temperature is between 20 degrees and 30 degrees). The main idea is to divide a field into subfields [15] in order that all of explicit and implicit values inside a subfield are similar each other on the value domain. Then the intervals of the value domain of subfields can be indexed using traditional spatial access methods, like R*-tree [1]. We propose an efficient and effective algorithm for constructing subfields. This is done by using the field property that values close spatially in a field are likely to be closer together. In more details, we linearize cells in order of the Hilbert value of the center position of cells. Then we form subfields by grouping sequentially cells by means of the cost function proposed in this paper, which tries to minimize the probability that subfields will be accessed by a value query. We implemented our method and carried out experiments on real and synthetic data. The results of experiments show that our method dramatically improves query processing time of field value queries compared to linear scanning.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    BECKMANN N., KRIEGEL R., SCHNEIDER R. and SEEGER B., “The R*-tree: An efficient and Robust Access Method for Points and Rectangles”, Proceedings of SIGMOD, pp. 322–331, 1990.Google Scholar
  2. 2.
    BIALLY T., “Space-filling Curves: Their generation and their application to bandwidth reduction”, IEEE Trans. on Information Theory, IT-15(6): 658–664, Nov. 1969.CrossRefGoogle Scholar
  3. 3.
    BURROUGH PA. and FRANK AU., Geographic Objects with Indeterminate Boundaries, Taylor and Francis. 345 p., 1996.Google Scholar
  4. 4.
    CIGNONI P., MONTANI C., PUPPO E., and SCOPIGNO R., “Optimal isosurface extraction from irregular volume data”, Proc., of Symposium on Volume Visualization, pp. 31–38, San Francisco, Oct. 1996.Google Scholar
  5. 5.
    EDELSBRUNNER H. Dynamic data structures for orthogonal intersection queries, Technical Report. F59. Inst. Informationsverarb., Technical University of Graz, Austria, 1980.Google Scholar
  6. 6.
    FALOUTSOS C., Gray Codes for Partial Match and Range Queries, IEEE Transactions on Software Engineering (TSE), Volume 14, pp. 1381–1393, 1989.CrossRefMathSciNetGoogle Scholar
  7. 7.
    FALOUTSOS C. and ROSEMAN S., Fractals for Secondary Key Retrieval, Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on PODS, Philadelphia, Pennsylvania, pp. 247–252, 1989.Google Scholar
  8. 8.
    FALOUTSOS C., Searching Multimedia Databases by Contents, Kluwer Academic Press. 155p, 1996.Google Scholar
  9. 9.
    GOODCHILD M.F, Unit 054-Representing Fields, The NCGIA Core Curriculum in GIScience, http://www.ncgia.ucsb.edu/education/curricula/giscc/units/u054.
  10. 10.
    GORDILLO S. and BALAGUER F., “Refining an Object-oriented GIS design Model: Topologies and Field Data”. Proceedings of the 6th Int. Symposium on Advances in Geographic Information Systems, pp.76–81, Washington, D.C., USA, 1998.Google Scholar
  11. 11.
    GRIFFITHS J.G., “An algorithm for displaying a class of space-filling curves”, Software-Practice and Experience, 16(5):403–411, May 1986.MATHCrossRefGoogle Scholar
  12. 12.
    GUTTMAN A., “R-trees-a Dynamic Index Structure for Spatial Searching”, Proceedings of the ACM SIGMOD Conf., pp.47–57, Boston MA, 1994.Google Scholar
  13. 13.
    JAGADISH H.V., “Linear clustering of objects with multiple attributes”, ACM SIGMOD Conf., pp.332–342, May 1990.Google Scholar
  14. 14.
    KAMEL I. and FALOUTSOS C., “On packing r-trees”, Second Int. Conf. on Information and Knowledge Management (CIKM), Nov. 1993.Google Scholar
  15. 15.
    KANG M-A., SERVIGNE S., LI K.J., LAURINI R., “Indexing Field Values in Field Oriented Systems: Interval Quadtree”, 8th Int. CIKM, pp. 335–342, Kansas City, USA, Nov. 1999.Google Scholar
  16. 16.
    KEMP K., “Environmental Modelling with GIS: A Strategy for Dealing with Spatial Continuity”, Technical Report No. 93-3, National Center for Geographical Information and Analysis, University of California, Santa Barbara, 1993.Google Scholar
  17. 17.
    LAURINI R. and THOMPSON D., Fundamentals of Spatial Information Systems, Academic Press, 1992.Google Scholar
  18. 18.
    LIN L., RISCH T., SKOLD M. and BADAL D.Z. Indexing Values of Time Sequences. Proceedings of the 5th Int. CIKM. Rockville, Maryland, USA., November 12–16, 1996. p. 223–232.Google Scholar
  19. 19.
    LIN L. and RISCH T. “Using a Sequential Index in Terrain-aided Navigation”, Proceedings of 6th Int. CIKM, Las Vegas, Nevada, Nov. 1997.Google Scholar
  20. 20.
    PARIENTE D., “Estimation, Modélisation et Langage de Déclaration et de Manipulation de Champs Spatiaux Continus”. PhD, Institut National des Sciences Appliquées de Lyon, 6 December, 192p, 1994.Google Scholar
  21. 21.
    PEITGEN H.O., Fractals for the classroom, New York: Springer-Verlag, 1992.Google Scholar
  22. 22.
    SAMET H., The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.Google Scholar
  23. 23.
    SELLIS T., ROUSSOPOULOS N. and FALOUTSOS C., “The R+-tree: A Dynamic Index for Multidimensional Objects”, Proceedings of VLDB, pp. 507–518, 1987.Google Scholar
  24. 24.
    VAN KREVELD M., “Efficient Methods for Isoline Extraction from a Digital Elevation Model based on Triangulated Irregular Networks”, Proceedings of 6th Int. Symposium on Spatial Data Handling, pp. 835–847, 1994.Google Scholar
  25. 25.
    VCKOVSKI A., “Representation of Continuous Fields”, Proceedings of 12 th Auto Carto, Vol.4, pp.127–136, 1995.Google Scholar
  26. 26.
    YU S., VAN KREVELD M., “Drainage Queries in TIN”, 7th Int. Symposium on Spatial Data Handling(SDH), Delft, Netherlands, Aug. 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Myoung-Ah Kang
    • 1
  • Christos Faloutsos
    • 2
  • Robert Laurini
    • 1
  • Sylvie Servigne
    • 1
  1. 1.LISIINSA de Lyon-Lyon Scientific and Technical UniversityVilleurbanneFrance
  2. 2.Dept. of Computer ScienceCarnegie Mellon UniversityPittsburgh

Personalised recommendations