Access methods and query processing techniques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2520, Issue , 2003, Pages 203-261

  Di Pasquale, Adriano ^c   Forlizzi, Luca ^c   Jensen, Christian S ^a   Manolopoulos, Yannis ^b   Nardelli, Enrico ^c   Pfoser, Dieter ^a   Proietti, Guido ^c,d   Šaltenis, Simonas ^a   Theodoridis, Yannis ^e   Tzouramanis, Theodoros ^b   Vassilakopoulos, Michael ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^c UNIVERSITY OF L'AQUILA   (Italy)

^d CNR   (Italy)

^e UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248831264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45081-8_6     Document Type: Article

References (107)

1. L. Arge, P. Argawal, and J. Erickson. Indexing moving points. In Proceedings 19th ACM PODS Symposium (PODS 2000), pages 175-186, 2000.
2. +-tree structure for large quadtrees. Computer Vision, Graphics and Image Processing, 27(1):19-31, 1984.
3. S. Acharya, V. Poosala, and S. Ramaswamy. Selectivity estimation in spatial databases. In Proceedings ACM SIGMOD Conference on Management of Data, pages 13-24, 1999.
4. L. Arge, V. Samoladas, and J.S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proceedings 19th ACM PODS Symposium (PODS 2000), pages 346-357, 1999.
5. A. Belussi and C. Faloutsos. Estimating the selectivity of spatial queries using the correlation fractal dimension. In Proceedings 21st Conference on Very Large Data Bases (VLDB'95), pages 299-310, 1995.
6. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In Proceedings 8th ACM-SIAM Symposium on Discrete Algorithms (SODA'97), pages 747-756, 1997.
7. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion B-tree. The VLDB Journal, 5(4):264-275, 1996.
8. F.W. Burton, M.W Huntbach, and J. Kollias. Multiple generation text files using overlapping tree structures. The Computer Journal, 28(4):414-416, 1985.
9. R. Bliujüte, C.S. Jensen, S. Saltenis, and G. Slivinskas. R-tree based indexing of now-relative bitemporal data. In Proceedings 24th Conference on Very Large Data Bases (VLDB'98), pages 345-356, 1998.
10. R. Bliujüte, C.S. Jensen, S. Šaltenis, and G. Slivinskas. Light-weight indexing of bitemporal data. In Proceedings 9th Conference on Statistical and Scientific Database Management Systems (SSDBM 2000), pages 125-138, 2000.
11. F.W Burton, J.G Kollias, and D.G. Matsakis. Implementation of overlapping B-trees for time and space efficient representation of collection of similar files. The Computer Journal, 33(3):279-280, 1990.
12. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust method for points and rectangles. In Proceedings ACM SIGMOD Conference on Management of Data, pages 322-331, 1990.
13. 2 n) time. Technical Report 146, Università di L'Aquila, 1997.
14. Accepted in Journal of Parallel and Distributed Computing.
15. J. Bercken and B. Seeger. Query processing techniques for multiversion access methods. In Proceedings 22nd Conference on Very Large Data Bases (VLDB'96), pages 168-179, 1996.
16. +-trees. In Proceedings 1st Workshop on Distributed Data and Structures (WDAS'98), 1998.
17. J. Clifford, C.E. Dyreson, T. Isakowitz, C.S. Jensen, and R.T. Snodgrass. On the semantics of "now". ACM Transactions on Database Systems, 22(2):171-214, 1997.
18. S. Christodoulakis. Implications of certain assumptions in database performance evaluation. ACM Transactions on Database Systems, 9(2):163-186, 1984.
19. J.P. Cheiney and A. Tourir. Fi-quadtree - A new data structure for content-oriented retrieval and fuzzy search. In Proceedings 2nd Symposium on Spatial Databases (SSD'91), pages 23-32, 1991.
20. S. Dieker and R.H. Güting. Efficient handling of tuples with embedded large objects. Technical Report Informatik-236, FernUniversität Hagen, 1998.
21. Also in Data and Knowledge Engineering, 32:247-268, 2000.
22. A. Di Pasquale and E. Nardelli. Balanced and distributed search trees. In Proceedings 2nd Workshop on Distributed Data and Structures (WDAS'99), pages 73-90, 1999.
23. A. Di Pasquale and E. Nardelli. Distributed searching of k-dimensional data with almost constant cost. In Proceedings 4th East European Conference on Advances in Databases and Information Systems (ADBIS 2000), volume 1884 Lecture Notes in Computer Science, pages 239-250, 2000.
24. J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86-124, 1989.
25. C.R. Dyer. The space efficiency of quadtrees. Computer Graphics and Image Processing, 19(4):335-348, 1982.
26. M. Erwig, R.H. Güting, M. Schneider, and M. Vazirgiannis. Spatio-temporal data types: An approach to modelling and querying moving objects in databases. GeoInformatica, 3(3):269-296, 1999.
27. C. Faloutsos and V. Gaede. Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension. In Proceedings 22nd Conference on Very Large Data Bases (VLDB'96), pages 40-50, 1996.
28. L. Forlizzi, R.H. Güting, E. Nardelli, and M. Schneider. A data model and data structures for moving objects databases. In Proceedings ACM SIGMOD Conference on Management of Data, pages 319-330, 2000.
29. C. Faloutsos and I. Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In Proceedings 13th ACM PODS Symposium (PODS'94), pages 4-13, 1994.
30. I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905-910, 1982.
31. R.H. Güting, T. de Ridder, and M. Schneider. Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types. In Proceedings 4th Symposium on Spatial Databases (SSD'95), pages 216-239, 1995.
32. V. Gaede and O. Günther. Multidimensional access methods. ACM Computer Surveys, 30(2):170-231, 1998.
33. C. Gurret, Y. Manolopoulos, A. Papadopoulos, and P. Rigaux. BASIS: A benchmarking approach for spatial index structures. In Proceedings Workshop on Spatiotemporal Database Management (STDBM'99), pages 152-170, 1999.
34. O. Günther, V. Oria, P. Picouet, J.-M. Saglio, and M. Scholl. Benchmarking spatial joins a la carte. In Proceedings 7th Conference on Statistical and Scientific Database Management Systems (SSDBM'98), pages 32-41, 1998.
35. C. Gurret and P. Rigaux. An integrated platform for the evaluation of spatial query processing strategies. In Proceedings 9th Conference on Database and Expert Systems Applications (DEXA'98), pages 757-766, 1998.
36. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings ACM SIGMOD Conference on Management of Data, pages 47-57, 1984.
37. O. Günther and E. Wong. A dual approach to detect polyhedral intersections in arbitrary dimensions. BIT, 31(1):3-14, 1991.
38. C.S. Jensen and R. Snodgrass. Semantics of time-varying information. Information Systems, 21(4):311-352, 1996.
39. E. Kawaguchi and T. Endo. 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.
40. I. Kamel and C. Faloutsos. On packing R-trees. In Proceedings 2nd Conference on Information and Knowledge Management (CIKM'93), pages 490-499, 1993.
41. G. Kollios, D. Gunopoulos, and V.J. Tsotras. On indexing mobile objects. In Proceedings 18th ACM PODS Symposium (PODS'99), pages 261-272, 1999.
42. D.E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973.
43. A. Kumar, V.J. Tsotras, and C. Faloutsos. Access methods for bi-temporal databases. In Proceedings Workshop on Temporal Databases, pages 235-254, 1995.
44. A. Kumar, V.J. Tsotras, and C. Faloutsos. Designing access methods for bi-temporal databases. IEEE Transactions on Knowledge and Data Engineering, 10(1):1-20, 1998.
45. B. Kröll and P. Widmayer. Distributing a search tree among a growing number of processor. In Proceedings ACM SIGMOD Conference on Management of Data, pages 265-276, 1994.
46. B. Kröll and P. Widmayer. Balanced distributed search trees do not exists. In Proceedings 4th Int. Workshop on Algorithms and Data Structures (WADS'95), volume 995 Lecture Notes in Computer Science, pages 50-61, 1995.
47. S.D. Lang and J.R. Driscoll. Improving the differential file technique via batch operations for tree structured file organizations. In Proceedings 2nd IEEE Conference on Data Engineering (ICDE'86), pages 524-532, 1986.
48. s* - A high performance multi-attribute scalable data structure. In Proceedings 4th Conference on Parallel and Distributed Information System (PDIS'96), pages 120-131, 1996.
49. W. Litwin, M.-A. Neimat, and D.A. Schneider. LH* - linear hashing for distributed files. In Proceedings ACM SIGMOD Conference on Management of Data, pages 327-336, 1993.
50. W. Litwin, M.-A. Neimat, and D.A. Schneider. RP*: A family of order preserving scalable distributed data structures. In Proceedings 20th Conference on Very Large Data Bases (VLDB'94), pages 342-353, 1994.
51. J. Van Leeuwen and R.E. Tarjan. Worst-case analysis of set union algorithms. Journal of the ACM, 31:245-281, 1984.
52. +-trees for temporal data. In Proceedings 5th Jerusalem Conference on Information Technology (JCIT'90), pages 491-498, 1990.
53. Y. Manolopoulos, E. Nardelli, A. Papadopoulos, and G. Proietti. MOF-tree: A spatial access method to manipulate multiple overlapping features. Information Systems, 22(8):465-481, 1997.
54. Y. Manolopoulos, Y. Theodoridis, and V. Tsotras. Advanced Database Indexing. Kluwer Academic Publishers, 1999.
55. E. Nardelli. Distributed k-d trees. In Proceedings 16th Conference of Chilean Computer Science Society (SCCC'96), pages 142-154, 1996.
56. E. Nardelli, F. Barillari, and M. Pepe. Design issues in distributed searching of multi-dimensional data. In Proceedings 3rd International Symposium on Programming and Systems (ISPS'97), 1997.
57. E. Nardelli, F. Barillari, and M. Pepe. Distributed searching of multi-dimensional data: A performance evaluation study. Journal of Parallel and Distributed Computing, 49(1):111-134, 1998.
58. S. Nishida, H. Nozawa, and N. Saiwaki. Proposal of spatio-temporal indexing methods for moving objects. In Proceedings Entity-Relationship Workshop (ER'98), pages 484-495, 1998.
59. E. Nardelli and G. Proietti. Managing overlapping features in spatial database applications. In International Computer Symposium (ICS'94), pages 1297-1302, 1994.
60. E. Nardelli and G. Proietti. Efficient secondary memory processing of window queries on spatial data. Information Sciences, 84:67-83, 1995.
61. E. Nardelli and G. Proietti. Size estimation of the intersection join between two line segment datasets. In Proceedings 4rd East-European Conference on Advances in Databases and Information Systems (ADBIS 2000), pages 229-238, 2000.
62. R. Nelson and H. Samet. A population analysis of quadtrees with variable node size. Technical Report CAR-TR-241, University of Maryland, Computer Science Department, 1986.
63. M.A. Nascimento and J.R.O. Silva. Towards historical R-trees. In Proceedings 13th ACM Symposium on Applied Computing (ACM-SAC'98), 1998.
64. M.A. Nascimento, J.R.O. Silva, and Y. Theodoridis. Access structures for moving points. Technical Report TR-33, TimeCenter, 1998.
65. M.A. Nascimento, J.R.O Silva, and Y. Theodoridis. Evaluation for access structures for discretely moving points. In Proceedings Workshop on Spatio-Temporal Database Management (STDBM'99), pages 171-188, 1999.
66. J. Orenstein. Spatial query processing in an object-oriented database system. In Proceedings ACM SIGMOD Conference on Management of Data, pages 326-336, 1986.
67. G. Proietti and C. Faloutsos. Accurate modeling of region data. Technical Report 98-137, Carnegie-Mellon University, 1998.
68. Also in IEEE Transactions on Knowledge and Data Engineering, 13(6):874-883, November/December 2001.
69. G. Proietti and C. Faloutsos. Selectivity estimation of windows queries for line segment datasets. In Proceedings 7th Conference on Information and Knowledge Management (CIKM'98), pages 340-347, 1998.
70. G. Proietti and C. Faloutsos. I/O complexity for range queries on region data stored using an R-tree. In Proceedings 15th IEEE Conference on Data Engineering (ICDE'99), pages 628-635, 1999.
71. G. Proietti and C. Faloutsos. 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, September/October 2000.
72. D. Pfoser, C.S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving objects. In Proceedings 26th Conference on Very Large Data Bases (VLDB 2000), pages 395-406, 2000.
73. A. Papadopoulos and Y. Manolopoulos. Performance of nearest neighbor queries in R-trees. In Proceedings 6th International Conference on Database Theory (ICDT'97), pages 394-408, 1997.
74. +-tree: A space efficient representation of images containing multiple overlapping features. Journal of Computing and Information, 2:42-56, 1996.
75. G. Proietti. An optimal algorithm for decomposing a window into its maximal blocks. Acta Informatica, 36(4):257-266, 1999.
76. A. Papadopoulos, P. Rigaux, and M. Scholl. A performance evaluation of spatial processing strategies. In Proceedings 6th Symposium on Spatial Databases (SSD'99), pages 286-307, 1999.
77. B. Pagel, H. Six, H. Toben, and P. Widmayer. Towards an analysis of range query performance. In Proceedings 12th ACM PODS Symposium (PODS'93), pages 214-221, 1993.
78. S. Ravada and J. Sharma. Oracle8i spatial: Experiences with extensible databases. In Proceedings 6th Symposium on Spatial Databases (SSD'99), pages 355-359, 1999.
79. R.T. Snodgrass and T. Ahn. A taxonomy of time in databases. In Proceedings ACM SIGMOD Conference on Management of Data, pages 236-246, 1985.
80. Y. Sagiv. Concurrent operations on B*-trees with overtaking. Journal of Computer and System Sciences, 3(2):275-296, 1986.
81. H. Samet. Applications of Spatial Data Structures. Addison-Wesley, 1990.
82. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
83. S. Šaltenis and C.S. Jensen. R-tree based indexing of general spatio-temporal data. Technical Report TR-45 and Chorochronos CH-99-18, TimeCenter, 1999.
84. S. Šaltenis, C.S. Jensen, S. Leutenegger, and M. Lopez. Indexing the positions of continuously moving objects. In Proceedings ACM SIGMOD Conference on Management of Data, pages 331-342, 2000.
85. N. Saiwaki, A. Naka, and S. Nishida. Spatio-temporal data management for highly interactive environment. In Proceedings 6th IEEE Workshop on Robot and Human Communication (ROMAN'97), pages 571-576333, 1997.
86. R.T. Snodgrass. The temporal query language TQuel. ACM Transactions on Database Systems, 12(2):247-298, 1987.
87. B. Salzberg and V. Tsotras. A comparison of access methods for time evolving data. ACM Computing Surveys, 31(2):158-212, 1999.
88. +-trees: An implementation of a temporal access method. Data and Knowledge Engineering, 29(3):381-404, 1999.
89. T. Teraoka, M. Maruyama, Y. Nakamura, and S. Nishida. The MP-tree: A data structure for spatio-temporal data. In Proceedings 14th IEEE Annual Phoenix Conference on Computers and Communications, pages 326-333, 1995.
90. A. Tourir. A multi-layer quadtree: A spatial data structure for multi-layer processing. Geoinformatica, 2001.
91. Y. Theodoridis and T. Sellis. A model for the prediction of R-tree performance. In Proceedings 15th ACM PODS Symposium (PODS'96), pages 161-171, 1996.
92. Y. Theodoridis, J.R.O. Silva, and M.A. Nascimento. On the generation of spatiotemporal datasets. In Proceedings 6th Symposium on Spatial Databases (SSD'99), pages 147-164, 1999.
93. Y. Theodoridis, T. Sellis, A. Papadopoulos, and Y. Manolopoulos. Specifications for efficient indexing in spatiotemporal databases. In Proceedings 7th Conference on Statistical and Scientific Database Management Systems (SSDBM'98), pages 123-132, 1998.
94. J. Tayeb, O. Ulusoy, and O. Wolfson. A quadtree based dynamic attribute indexing method. The Computer Journal, 41(3):185-200, 1998.
95. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Overlapping linear quadtrees: A spatio-temporal access method. In Proceedings 6th ACM Symposium on Advances in Geographic Information Systems (ACM-GIS'98), pages 1-7, 1998.
96. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Processing of spatio-temporal queries in image databases. In Proceedings 3rd East-European Conference on Advances in Databases and Information Systems (ADBIS'99), pages 85-97, 1999.
97. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Multiversion linear quadtrees for spatio-temporal data. In Proceedings 4rd East-European Conference on Advances in Databases and Information Systems (ADBIS 2000), pages 279-292, 2000.
98. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Overlapping linear quadtrees and window query processing in spatio-temporal databases. The Computer Journal, 43(4):325-344, 2000.
99. Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-temporal indexing for large multimedia applications. In Proceedings 3rd IEEE Conference on Multimedia Computing and Systems (ICMCS'96), pages 441-448, 1996.
100. M. Vassilakopoulos and Y. Manolopoulos. Dynamic inverted quadtrees - A structure for pictorial databases. Information Systems, 20(6):483-500, 1995.
101. M. Vassilakopoulos, Y. Manolopoulos, and K. Economou. Overlapping for the representation of similar images. Image and Vision Computing, 11(5):257-262, 1993.
102. M. Vassilakopoulos, Y. Manolopoulos, and B. Kröll. Efficiency analysis of overlapped quadtrees. Nordic Journal of Computing, 2:70-84, 1995.
103. M. Vazirgiannis, Y. Theodoridis, and T. Sellis. Spatio-temporal composition and indexing large multimedia applications. Multimedia Systems, 6(4):284-298, 1998.
104. O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving objects databases: Issues and solutions. In Proceedings 10th Conference on Scientific and Statistical Database Management, pages 111-122, 1998.
105. X. Xu, J. Han, and W. Lu. RT-tree - An improved R-tree index structure for spatiotemporal databases. In Proceedings 4th Symposium on Spatial Data Handling (SDH'90), pages 1040-1049, 1990.
106. G. Zimbrao, J. Moreira de Souza, R. Chaomey Wo, and V. Teixeira de Almeida. 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, pages 46-51, 2000.
107. G. Zimbrao, J. Moreira de Souza, and V. Teixeira de Almeida. The temporal R-tree. Technical Report ES-429/99, Federal University of Rio de Janeiro, Computer Science Department, 1999.