Skip to main content
SpringerLink
Log in

Chapter 6: Access Methods and Query Processing Techniques

  • Chapter
Spatio-Temporal Databases

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2520))

Abstract

The performance of a database management system (DBMS) is fundamentally dependent on the access methods and query processing techniques available to the system. Traditionally, relational DBMSs have relied on well-known access methods, such as the ubiquitous B + -tree, hashing with chaining, and, in some cases, linear hashing [52]. Object-oriented and object-relational systems have also adopted these structures to a great extend.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arge, L., Argawal, P., Erickson, J.: Indexing moving points. In: Proceedings 19th ACM PODS Symposium (PODS 2000), pp. 175–186 (2000)

    Google Scholar 

  2. Abel, D.J.: A B + -tree structure for large quadtrees. Computer Vision, Graphics and Image Processing 27(1), 19–31 (1984)

    Article  Google Scholar 

  3. Acharya, S., Poosala, V., Ramaswamy, S.: Selectivity estimation in spatial databases. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 13–24 (1999)

    Google Scholar 

  4. Arge, L., Samoladas, V., Vitter, J.S.: On two-dimensional indexability and optimal range search indexing. In: Proceedings 19th ACM PODS Symposium (PODS 2000), pp. 346–357 (1999)

    Google Scholar 

  5. Belussi, A., Faloutsos, C.: Estimating the selectivity of spatial queries using the correlation fractal dimension. In: Proceedings 21st Conference on Very Large Data Bases (VLDB 1995), pp. 299–310 (1995)

    Google Scholar 

  6. Basch, J., Guibas, L., Hershberger, J.: Data structures for mobile data. In: Proceedings 8th ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 747–756 (1997)

    Google Scholar 

  7. Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-tree. The VLDB Journal 5(4), 264–275 (1996)

    Article  Google Scholar 

  8. Burton, F.W., Huntbach, M.W., Kollias, J.: Multiple generation text files using overlapping tree structures. The Computer Journal 28(4), 414–416 (1985)

    Article  Google Scholar 

  9. Bliujūtė, R., Jensen, C.S., Šaltenis, S., Slivinskas, G.: R-tree based indexing of now-relative bitemporal data. In: Proceedings 24th Conference on Very Large Data Bases (VLDB 1998), pp. 345–356 (1998)

    Google Scholar 

  10. Bliujūtė, R., Jensen, C.S., Šaltenis, S., Slivinskas, G.: Light-weight indexing of bitemporal data. In: Proceedings 9th Conference on Statistical and Scientific Database Management Systems (SSDBM 2000), pp. 125–138 (2000)

    Google Scholar 

  11. Burton, F.W., Kollias, J.G., Matsakis, D.G.: Implementation of overlapping B-trees for time and space efficient representation of collection of similar files. The Computer Journal 33(3), 279–280 (1990)

    Article  Google Scholar 

  12. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust method for points and rectangles. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 322–331 (1990)

    Google Scholar 

  13. Barillari, F., Nardelli, E., Pepe, M.: Fully dynamic search trees can be balanced in O(log2 n) time. Technical Report 146, Universitá di L’Aquila (1997); Accepted in Journal of Parallel and Distributed Computing

    Google Scholar 

  14. Bercken, J., Seeger, B.: Query processing techniques for multiversion access methods. In: Proceedings 22nd Conference on Very Large Data Bases (VLDB 1996), pp. 168–179 (1996)

    Google Scholar 

  15. Breitbart, Y., Vingralek, R.: Addressing and balancing issues in distributed B + -trees. In: Proceedings 1st Workshop on Distributed Data and Structures, WDAS 1998 (1998)

    Google Scholar 

  16. Clifford, J., Dyreson, C.E., Isakowitz, T., Jensen, C.S., Snodgrass, R.T.: On the semantics of “now”. ACM Transactions on Database Systems 22(2), 171–214 (1997)

    Article  Google Scholar 

  17. Christodoulakis, S.: Implications of certain assumptions in database performance evaluation. ACM Transactions on Database Systems 9(2), 163–186 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  18. Cheiney, J.P., Tourir, A.: Fi-quadtree - A new data structure for contentoriented retrieval and fuzzy search. In: Günther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol. 525, pp. 23–32. Springer, Heidelberg (1991)

    Google Scholar 

  19. Dieker, S., Güting, R.H.: Efficient handling of tuples with embedded large objects. Technical Report Informatik-236, FernUniversität Hagen (1998); Also in Data and Knowledge Engineering 32, 247–268 (2000)

    Google Scholar 

  20. Di Pasquale, A., Nardelli, E.: Balanced and distributed search trees. In: Proceedings 2nd Workshop on Distributed Data and Structures (WDAS 1999), pp. 73–90 (1999)

    Google Scholar 

  21. Di Pasquale, A., Nardelli, E.: Distributed searching of k-dimensional data with almost constant cost. In: Masunaga, Y., Thalheim, B., Štuller, J., Pokorný, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol. 1884, pp. 239–250. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38, 86–124 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  23. Dyer, C.R.: The space efficiency of quadtrees. Computer Graphics and Image Processing 19(4), 335–348 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  24. Erwig, M., Güting, R.H., Schneider, M., Vazirgiannis, M.: Spatio-temporal data types: An approach to modelling and querying moving objects in databases. GeoInformatica 3(3), 269–296 (1999)

    Article  Google Scholar 

  25. Faloutsos, C., Gaede, V.: Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension. In: Proceedings 22nd Conference on Very Large Data Bases (VLDB 1996), pp. 40–50 (1996)

    Google Scholar 

  26. Forlizzi, L., Güting, R.H., Nardelli, E., Schneider, M.: A data model and data structures for moving objects databases. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 319–330 (2000)

    Google Scholar 

  27. Faloutsos, C., Kamel, I.: Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In: Proceedings 13th ACM PODS Symposium (PODS 1994), pp. 4–13 (1994)

    Google Scholar 

  28. Gargantini, I.: An effective way to represent quadtrees. Communications of the ACM 25(12), 905–910 (1982)

    Article  MATH  Google Scholar 

  29. Güting, R.H., de Ridder, T., Schneider, M.: Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 216–239. Springer, Heidelberg (1995)

    Google Scholar 

  30. Gaede, V., Günther, O.: Multidimensional access methods. ACM Computer Surveys 30(2), 170–231 (1998)

    Article  Google Scholar 

  31. Gurret, C., Manolopoulos, Y., Papadopoulos, A., Rigaux, P.: BASIS: A benchmarking approach for spatial index structures. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 152–170. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  32. Günther, O., Oria, V., Picouet, P., Saglio, J.-M., Scholl, M.: Benchmarking spatial joins a la carte. In: Proceedings 7th Conference on Statistical and Scientific Database Management Systems (SSDBM 1998), pp. 32–41 (1998)

    Google Scholar 

  33. Gurret, C., Rigaux, P.: An integrated platform for the evaluation of spatial query processing strategies. In: Quirchmayr, G., Bench-Capon, T.J.M., Schweighofer, E. (eds.) DEXA 1998. LNCS, vol. 1460, pp. 757–766. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  34. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 47–57 (1984)

    Google Scholar 

  35. Günther, O., Wong, E.: A dual approach to detect polyhedral intersections in arbitrary dimensions. BIT 31(1), 3–14 (1991)

    Google Scholar 

  36. Jensen, C.S., Snodgrass, R.: Semantics of time-varying information. Information Systems 21(4), 311–352 (1996)

    Article  Google Scholar 

  37. Kawaguchi, E., Endo, T.: On a method of binary picture representation and its application to data compression. IEEE Transactions on Pattern Analysis and Machine Intelligence 2(1), 27–35 (1980)

    Article  MATH  Google Scholar 

  38. Kamel, I., Faloutsos, C.: On packing R-trees. In: Proceedings 2nd Conference on Information and Knowledge Management (CIKM 1993), pp. 490–499 (1993)

    Google Scholar 

  39. Kollios, G., Gunopoulos, D., Tsotras, V.J.: On indexing mobile objects. In: Proceedings 18th ACM PODS Symposium (PODS 1999), pp. 261–272 (1999)

    Google Scholar 

  40. Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1973)

    Google Scholar 

  41. Kumar, A., Tsotras, V.J., Faloutsos, C.: Access methods for bi-temporal databases. In: Proceedings Workshop on Temporal Databases, pp. 235–254 (1995)

    Google Scholar 

  42. Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing access methods for bitemporal databases. IEEE Transactions on Knowledge and Data Engineering 10(1), 1–20 (1998)

    Article  Google Scholar 

  43. Kröll, B., Widmayer, P.: Distributing a search tree among a growing number of processor. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 265–276 (1994)

    Google Scholar 

  44. Kröll, B., Widmayer, P.: Balanced distributed search trees do not exists. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 50–61. Springer, Heidelberg (1995)

    Google Scholar 

  45. Lang, S.D., Driscoll, J.R.: Improving the differential file technique via batch operations for tree structured file organizations. In: Proceedings 2nd IEEE Conference on Data Engineering (ICDE 1986), pp. 524–532 (1986)

    Google Scholar 

  46. Litwin, W., Neimat, M.A.: \({\rm} k-RP^{*}_{s}\)- A high performance multi-attribute scalable data structure. In: Proceedings 4th Conference on Parallel and Distributed Information System (PDIS 1996), pp. 120–131 (1996)

    Google Scholar 

  47. Litwin, W., Neimat, M.-A., Schneider, D.A.: LH* - linear hashing for distributed files. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 327–336 (1993)

    Google Scholar 

  48. Litwin, W., Neimat, M.-A., Schneider, D.A.: RP*: A family of order preserving scalable distributed data structures. In: Proceedings 20th Conference on Very Large Data Bases (VLDB 1994), pp. 342–353 (1994)

    Google Scholar 

  49. Van Leeuwen, J., Tarjan, R.E.: Worst-case analysis of set union algorithms. Journal of the ACM 31, 245–281 (1984)

    Article  MATH  Google Scholar 

  50. Manolopoulos, Y., Kapetanakis, G.: Overlapping B + -trees for temporal data. In: Proceedings 5th Jerusalem Conference on Information Technology (JCIT 1990), pp. 491–498 (1990)

    Google Scholar 

  51. Manolopoulos, Y., Nardelli, E., Papadopoulos, A., Proietti, G.: MOF-tree: A spatial access method to manipulate multiple overlapping features. Information Systems 22(8), 465–481 (1997)

    Article  Google Scholar 

  52. Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Advanced Database Indexing. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  53. Nardelli, E.: Distributed k-d trees. In: Proceedings 16th Conference of Chilean Computer Science Society (SCCC 1996), pp. 142–154 (1996)

    Google Scholar 

  54. Nardelli, E., Barillari, F., Pepe, M.: Design issues in distributed searching of multi-dimensional data. In: Proceedings 3rd International Symposium on Programming and Systems, ISPS 1997 (1997)

    Google Scholar 

  55. Nardelli, E., Barillari, F., Pepe, M.: Distributed searching of multi-dimensional data: A performance evaluation study. Journal of Parallel and Distributed Computing 49(1), 111–134 (1998)

    Article  MATH  Google Scholar 

  56. Nishida, S., Nozawa, H., Saiwaki, N.: Proposal of spatio-temporal indexing methods for moving objects. In: Proceedings Entity-Relationship Workshop (ER 1998), pp. 484–495 (1998)

    Google Scholar 

  57. Nardelli, E., Proietti, G.: Managing overlapping features in spatial database applications. In: International Computer Symposium (ICS 1994), pp. 1297–1302 (1994)

    Google Scholar 

  58. Nardelli, E., Proietti, G.: Efficient secondary memory processing of window queries on spatial data. Information Sciences 84, 67–83 (1995)

    Article  Google Scholar 

  59. Nardelli, E., Proietti, G.: Size estimation of the intersection join between two line segment datasets. In: Masunaga, Y., Thalheim, B., Štuller, J., Pokorný, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol. 1884, pp. 229–238. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  60. Nelson, R., Samet, H.: A population analysis of quadtrees with variable node size. Technical Report CAR-TR-241, University of Maryland, Computer Science Department (1986)

    Google Scholar 

  61. Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: Proceedings 13th ACM Symposium on Applied Computing (ACM-SAC 1998) (1998)

    Google Scholar 

  62. Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Access structures for moving points. Technical Report TR-33, TimeCenter (1998)

    Google Scholar 

  63. Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Evaluation for access structures for discretely moving points. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 171–188. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  64. Orenstein, J.: Spatial query processing in an object-oriented database system. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 326–336 (1986)

    Google Scholar 

  65. Proietti, G., Faloutsos, C.: Accurate modeling of region data. Technical Report 98-137, Carnegie-Mellon University (1998); Also in IEEE Transactions on Knowledge and Data Engineering 13(6), 874–883 (2001)

    Google Scholar 

  66. Proietti, G., Faloutsos, C.: Selectivity estimation of windows queries for line segment datasets. In: Proceedings 7th Conference on Information and Knowledge Management (CIKM 1998), pp. 340–347 (1998)

    Google Scholar 

  67. Proietti, G., Faloutsos, C.: I/O complexity for range queries on region data stored using an R-tree. In: Proceedings 15th IEEE Conference on Data Engineering (ICDE 1999), pp. 628–635 (1999)

    Google Scholar 

  68. Proietti, G., Faloutsos, C.: Analysis of range queries and self spatial join queries on real region datasets stored using an R-tree. IEEE Transactions on Knowledge and Data Engineering 12(5), 751–762 (2000)

    Article  Google Scholar 

  69. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches in query processing for moving objects. In: Proceedings 26th Conference on Very Large Data Bases (VLDB 2000), pp. 395–406 (2000)

    Google Scholar 

  70. Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in R-trees. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 394–408. Springer, Heidelberg (1996)

    Google Scholar 

  71. Proietti, G.: The MOF + -tree: A space efficient representation of images containing multiple overlapping features. Journal of Computing and Information 2, 42–56 (1996)

    Google Scholar 

  72. Proietti, G.: An optimal algorithm for decomposing a window into its maximal blocks. Acta Informatica 36(4), 257–266 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  73. Papadopoulos, A., Rigaux, P., Scholl, M.: A performance evaluation of spatial processing strategies. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 286–307. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  74. Pagel, B., Six, H., Toben, H., Widmayer, P.: Towards an analysis of range query performance. In: Proceedings 12th ACM PODS Symposium (PODS 1993), pp. 214–221 (1993)

    Google Scholar 

  75. Ravada, S., Sharma, J.: Oracle8i spatial: Experiences with extensible databases. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 355–359. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  76. Snodgrass, R.T., Ahn, T.: A taxonomy of time in databases. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 236–246 (1985)

    Google Scholar 

  77. Sagiv, Y.: Concurrent operations on B*-trees with overtaking. Journal of Computer and System Sciences 3(2), 275–296 (1986)

    Article  MathSciNet  Google Scholar 

  78. Samet, H.: Applications of Spatial Data Structures. Addison-Wesley, Reading (1990)

    Google Scholar 

  79. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)

    Google Scholar 

  80. Šaltenis, S., Jensen, C.S.: R-tree based indexing of general spatio-temporal data. Technical Report TR-45 and Chorochronos CH-99-18, TimeCenter (1999)

    Google Scholar 

  81. Šaltenis, S., Jensen, C.S., Leutenegger, S., Lopez, M.: Indexing the positions of continuously moving objects. In: Proceedings ACM SIGMOD Conference on Management of Data, pp. 331–342 (2000)

    Google Scholar 

  82. Saiwaki, N., Naka, A., Nishida, S.: Spatio-temporal data management for highly interactive environment. In: Proceedings 6th IEEE Workshop on Robot and Human Communication (ROMAN 1997), pp. 571–576 (1997)

    Google Scholar 

  83. Snodgrass, R.T.: The temporal query language TQuel. ACM Transactions on Database Systems 12(2), 247–298 (1987)

    Article  Google Scholar 

  84. Salzberg, B., Tsotras, V.: A comparison of access methods for time evolving data. ACM Computing Surveys 31(2), 158–212 (1999)

    Article  Google Scholar 

  85. Tzouramanis, T., Manolopoulos, Y., Lorentzos, N.: Overlapping B + -trees: An implementation of a temporal access method. Data and Knowledge Engineering 29(3), 381–404 (1999)

    Article  MATH  Google Scholar 

  86. Teraoka, T., Maruyama, M., Nakamura, Y., Nishida, S.: The MP-tree: A data structure for spatio-temporal data. In: Proceedings 14th IEEE Annual Phoenix Conference on Computers and Communications, pp. 326–333 (1995)

    Google Scholar 

  87. Tourir, A.: A multi-layer quadtree: A spatial data structure for multi-layer processing. Geoinformatica (2001)

    Google Scholar 

  88. Theodoridis, Y., Sellis, T.: A model for the prediction of R-tree performance. In: Proceedings 15th ACM PODS Symposium (PODS 1996), pp. 161–171 (1996)

    Google Scholar 

  89. Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the generation of spatiotemporal datasets. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 147–164. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  90. Theodoridis, Y., Sellis, T., Papadopoulos, A., Manolopoulos, Y.: Specifications for efficient indexing in spatiotemporal databases. In: Proceedings 7th Conference on Statistical and Scientific Database Management Systems (SSDBM 1998), pp. 123–132 (1998)

    Google Scholar 

  91. Tayeb, J., Ulusoy, O., Wolfson, O.: A quadtree based dynamic attribute indexing method. The Computer Journal 41(3), 185–200 (1998)

    Article  MATH  Google Scholar 

  92. Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Overlapping linear quadtrees: A spatio-temporal access method. In: Proceedings 6th ACM Symposium on Advances in Geographic Information Systems (ACM-GIS 1998), pp. 1–7 (1998)

    Google Scholar 

  93. Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Processing of spatiotemporal queries in image databases. In: Eder, J., Rozman, I., Welzer, T. (eds.) ADBIS 1999. LNCS, vol. 1691, pp. 85–97. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  94. Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Multiversion linear quadtrees for spatio-temporal data. In: Masunaga, Y., Thalheim, B., Štuller, J., Pokorný, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol. 1884, pp. 279–292. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  95. Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Overlapping linear quadtrees and window query processing in spatio-temporal databases. The Computer Journal 43(4), 325–344 (2000)

    Article  MATH  Google Scholar 

  96. Theodoridis, Y., Vazirgiannis, M., Sellis, T.: Spatio-temporal indexing for large multimedia applications. In: Proceedings 3rd IEEE Conference on Multimedia Computing and Systems (ICMCS 1996), pp. 441–448 (1996)

    Google Scholar 

  97. Vassilakopoulos, M., Manolopoulos, Y.: Dynamic inverted quadtrees - A structure for pictorial databases. Information Systems 20(6), 483–500 (1995)

    Article  Google Scholar 

  98. Vassilakopoulos, M., Manolopoulos, Y., Economou, K.: Overlapping for the representation of similar images. Image and Vision Computing 11(5), 257–262 (1993)

    Article  Google Scholar 

  99. Vassilakopoulos, M., Manolopoulos, Y., Kröll, B.: Efficiency analysis of overlapped quadtrees. Nordic Journal of Computing 2, 70–84 (1995)

    MATH  MathSciNet  Google Scholar 

  100. Vazirgiannis, M., Theodoridis, Y., Sellis, T.: Spatio-temporal composition and indexing large multimedia applications. Multimedia Systems 6(4), 284–298 (1998)

    Article  Google Scholar 

  101. Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving objects databases: Issues and solutions. In: Proceedings 10th Conference on Scientific and Statistical Database Management, pp. 111–122 (1998)

    Google Scholar 

  102. Xu, X., Han, J., Lu, W.: RT-tree - An improved R-tree index structure for spatiotemporal databases. In: Proceedings 4th Symposium on Spatial Data Handling (SDH 1990), pp. 1040–1049 (1990)

    Google Scholar 

  103. Zimbrao, G., Moreira de Souza, J., Chaomey Wo, R., Teixeira de Almeida, V.: Efficient processing of spatiotemporal queries in temporal geographical information systems. In: Proceedings 4th Multiconference on Systemics, Cybernetics and Informatics, 6th Conference on Information Systems, Analysis and Synthesis (SCI/ISAS 2000), vol. 8, Part.II, pp. 46–51 (2000)

    Google Scholar 

  104. Zimbrao, G., Moreira de Souza, J., Teixeira de Almeida, V.: The temporal Rtree. Technical Report ES-429/99, Federal University of Rio de Janeiro, Computer Science Department (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aalborg University, Denmark

    Christian S. Jensen, Dieter Pfoser & Simonas Šaltenis

  2. Aristotle University, Thessaloniki, Greece

    Yannis Manolopoulos, Theodoros Tzouramanis & Michael Vassilakopoulos

  3. Universita Degli Studi di L’Aquila, Italy

    Adriano Di Pasquale, Luca Forlizzi, Enrico Nardelli & Guido Proietti

  4. National Research Council, Roma, Italy

    Guido Proietti

  5. University of Piraeus, Greece

    Yannis Theodoridis

Authors
  1. Adriano Di Pasquale
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Forlizzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian S. Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Enrico Nardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Dieter Pfoser
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Guido Proietti
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Simonas Šaltenis
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

  10. Theodoros Tzouramanis
    View author publications

    You can also search for this author in PubMed Google Scholar

  11. Michael Vassilakopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for the Management of Information Systems (R.C. “Athena”), Athens, Hellas

    Timos K. Sellis

  2. National and Kapodistrian University of Athens, Greece

    Manolis Koubarakis

  3. Dept. of Geoinformation Technical University of Vienna A-1040, Vienna, Austria

    Andrew Frank

  4. INRIA-LIAMA Institute of Automation, Beijing, China

    Stéphane Grumbach

  5. LG Datenbanksysteme für neue Anwendungen, FB Informatik, Fernuniversität Hagen, D-58084, Hagen, Germany

    Ralf Hartmut Güting

  6. Informatics and Mathematical Modelling, Technical University of Denmark, 2800, Lyngby, Denmark

    Christian Jensen

  7. Informatics Laboratory, Agricultural University of Athens, Iera Odos 75, GR 11855, Athens, Greece

    Nikos A. Lorentzos

  8. Data Engineering Research Lab. Department of Informatics, Aristotle University, 54124, Thessaloniki, Greece

    Yannis Manolopoulos

  9. NESTOR – Multimedia services security and certification Laboratory, University of Rome “Tor Vergata”, Italy

    Enrico Nardelli

  10. Politecnico di Milano, Italy

    Barbara Pernici

  11. Institute of Science and Technology, University of Manchester, United Kingdom

    Babis Theodoulidis

  12. Research Academic Computer Technology Institute, Akteou 11, 11851, Athens, Greece

    Nectaria Tryfona

  13. Professor Emeritus of the Swiss Federal Institute of Technology (ETH), Zurich, Switzerland

    Hans-Jörg Schek

  14. Cedric, Conservatoire National des Arts et Métiers, 75141, Paris Cedex 03, France

    Michel O. Scholl

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Di Pasquale, A. et al. (2003). Chapter 6: Access Methods and Query Processing Techniques. In: Sellis, T.K., et al. Spatio-Temporal Databases. Lecture Notes in Computer Science, vol 2520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45081-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45081-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40552-8

  • Online ISBN: 978-3-540-45081-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation