
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
George Kollios, Vassilis J. Tsotras, Dimitrios Gunopulos, Alex Delis, Marios Hadjieleftheriou, "Indexing Animated Objects Using Spatiotemporal Access Methods," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 5, pp. 758777, September/October, 2001.  
BibTex  x  
@article{ 10.1109/69.956099, author = {George Kollios and Vassilis J. Tsotras and Dimitrios Gunopulos and Alex Delis and Marios Hadjieleftheriou}, title = {Indexing Animated Objects Using Spatiotemporal Access Methods}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {13}, number = {5}, issn = {10414347}, year = {2001}, pages = {758777}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.956099}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Indexing Animated Objects Using Spatiotemporal Access Methods IS  5 SN  10414347 SP758 EP777 EPD  758777 A1  George Kollios, A1  Vassilis J. Tsotras, A1  Dimitrios Gunopulos, A1  Alex Delis, A1  Marios Hadjieleftheriou, PY  2001 KW  Access methods KW  spatiotemporal databases KW  animated objects KW  multimedia. VL  13 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—We present a new approach for indexing animated objects and efficiently answering queries about their position in time and space. In particular, we consider an animated movie as a
[1] S. Adali, K.S. Candan, S.S. Chen, K. Erol, and V.S. Subrahmanian, “Advanced Video Information Systems,” ACM Multimedia Systems J., vol. 4, pp. 172186, 1996.
[2] P.K. Agarwal, L. Arge, and J. Erickson, “Indexing Moving Points,” Proc. 2000 ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS), May 2000.
[3] L. Arge, “The Buffer Tree: A New Technique for Optimal I/O Algorithms,” Proc. Workshop Algorithms and Data Structures, LNCS 955, pp. 334345, 1995.
[4] L. Arge, “ExternalMemory Algorithms with Applications in Geographic Information Systems,” Algorithmic Foundations of Geographic Information Systems, LNCS 1340, 1997.
[5] B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, "An Asymptotically Optimal Multiversion BTree," Very Large Data Bases J., vol. 5, no. 4, pp. 264275, 1996.
[6] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[7] J.L. Bentley, “Algorithms for Klee's Rectangle Problems,” technical report, Computer Science Department, CarnegieMellon Univ., Pittsburgh, Penn. 1977.
[8] S.F. Chang, W. Chen, H.E. Meng, H. Sundaram, and D. Zong, "VideoQ: An Automated Content Based Video Search System Using Visual Cues," Proc. ACM Multimedia, pp. 313324,Seattle, 1994.
[9] S.F. Chang, W. Chen, H. Meng, H. Sundaram, and D. Zhong, A Fully Automated ContentBased Video Search Engine Supporting Spatiotemporal Queries IEEE Trans. Circuits and Systems for Video Technology, vol. 8, no. 5, pp. 602615, 1998.
[10] K.L. Cheung and A. WaiChee Fu, “Enhanced Nearest Neighbor Search on the RTree,” SIGMOD Record, vol. 27, no. 3, pp. 1621, 1998.
[11] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[12] S. Dagtas, W. AlKhatib, A. Ghafoor, and A. Khokhar, “TrailBased Approach for Video Data Indexing and Retrieval,” Proc. IEEE Int'l Conf. Multimedia Computing and Systems, pp. 235239, 1999.
[13] L.G. Clark, L.I. Perlovsky, W.H, Schoendorf, C.P. Plum, and T.L. Keller, "Evaluation of FLIR Sensors for Automatic Target Recognition Using an InformationTheoretic Approach," IEEE Proc. NAECON, vol. 2, pp. 1,0481,055, 1993.
[14] J. Driscoll, N. Sarnak, D. Sleator, and R.E. Tarjan, “Making Data Structures Persistent,” Proc. 18h Ann. ACM Symp. Theory of Computing, 1986.
[15] M. Erwig, R.H. Goting, M. Schneider, and M. Vazirgiannis, “SpatioTemporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases,” GeoInformatica, vol. 3, no. 3, 1999.
[16] C. Faloutsos, R. Barber, M. Flicker, J. Hafner, W. Niblack, and W. Equitz, "Efficient and effective querying by image content," J. Intell. Information Systems," vol. 3, pp. 231262, 1994.
[17] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[18] A. Hamrapur, A. Gupta, B. Horowitz, C.F. Shu, C. Fuller, J. Bach, M. Gorkani, and R. Jain, “Virage Video Engine,” Proc. SPIE, pp. 188197, 1997.
[19] J. Hellerstein, E. Koutsoupias, and C. Papadimitriou, “On the Analysis of Indexing Schemes,” Proc. Principles of Database Systems (PODS '97), pp. 249–256, May 1997.
[20] H. Jiang and A. Elmagarmid, “Spatial and Temporal ContentBased Access to Hypervideo Databases,” Very Large Database J., vol. 7, no. 4, pp. 226238, 1998.
[21] C.S. Jensen and R.T. Snodgrass, “Temporal Data Management,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, pp. 36–45, 1999.
[22] I. Kamel and C. Faloutsos, "Hilbert RTree: An Improved RTree using Fractals," Proc. Int'l Conf. Very Large Data Bases, 1994.
[23] G. Kollios, D. Gunopulos, and V.J. Tsotras, “On Indexing Mobile Objects,” Proc. 18th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, 1999.
[24] C. Kolovson and M. Stonebraker, "Segment Indexes: Dynamic Indexing Techniques for MultiDimensional Interval Data," Proc. ACM SIGMOD Conf., pp. 138147, 1991.
[25] A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 120, 1998.
[26] S.T. Leutenegger, M.A. Lopez, and J.M. Edgington, “Str: A Simple and Efficient Algorithm for RTree Packing,” Proc. Int'l Conf. Data Eng. (ICDE '97), pp. 497–506, Apr. 1997.
[27] J.Z. Li, I. Goralwalla, M.T. Ozsu, and D. Szafron, “Modeling Video Temporal Relationship in an Object Database Management System,” IS&T/SPIE Int'l Symp. Electronic Imaging: Multimedia Computing and Networking, pp. 8091, 1997.
[28] D. Lomet and B. Salzberg, "Access Methods for Multiversion Data," Proc. ACM SIGMOD Conf., pp. 315324, 1989.
[29] M. Nascimento and J. Silva, “Towards Historical RTrees,” Proc. ACM Symp. Applied Computing, pp. 235240, 1998.
[30] M. Nascimento, J. Silva, Y. Theodoridis, “Evaluation of Access Structures for Discretely Moving Points,” Proc. Spatiotemporial Database Management, (STDBM '99), LCNS 1678, pp. 171188, 1999.
[31] J.A. Orenstein, “Redundancy in Spatial Databases,” Proc. ACM SIGMOD Conf., pp. 326336, 1986.
[32] J.A. Orenstein, "A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces," Proc. SIGMOD Int'l Conf. Management Data, pp. 343352, ACM, 1990.
[33] D. Pfoser, C.S. Jensen, and Y. Theodoridis, “Novel Approaches in Query Processing for Moving Objects,” Proc. 26th Int'l Conf. Very Large Databases (VLDB), Sept. 2000.
[34] S.V. Raghavan and S.K. Tripathy, Networked Multimedia Systems. PrenticeHall, 1998.
[35] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 7179, 1995.
[36] S. Saltenis and C. Jensen, “RTree Based Indexing of General SpatioTemporal Data,” Technical Report, TR45, Time Center, 1999.
[37] S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, “Indexing the Positions of Continuously Moving Objects,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 331342, May 2000.
[38] B. Salzberg and V.J. Tsotras, "A Comparison of Access Methods for TimeEvolving Data," ACM Computing Surveys, to appear; also available as Technical Report No. TR18, TimeCenter, Aalborg Univ., 1997: .
[39] H. Samet, The Design and Analysis of Spatial Data Structures. AddisonWesley, 1990.
[40] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[41] J.R. Smith and S.F. Chang, “VisualSEEk: A Fully Automated ContentBased Image Query System,” ACM Multimedia '96, Nov. 1996.
[42] A.P. Sistla, C. Yu, and R. Venkatasubrahmanian, "Similarity Based Retrieval of Videos," Proc. IEEE Data Eng. Conf., 1997.
[43] V.S. Subrahmanian, Principles of Multimedia Database Systems. Morgan Kaufmann, 1998.
[44] H. Sundaram, S.F. Chang, “Efficient Video Sequence Retrieval in Large Repositories,” Proc. SPIE Storage and Retrieval for Image and Video Databases, 1999.
[45] Y. Theodoridis and T. Sellis, “A Model for the Prediction of Rtree Performance,” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[46] Y. Theodoridis, T. Sellis, A.N. Papadopoulos, and Y. Manolopoulos, Specifications for Efficient Indexing in Spatiotemporal Databases Proc. 11th Int'l Conf. Scientific and Statistical Database Management, 1999.
[47] Y. Theodoridis, J. Silva, and M. Nascimento, “On the Generation of Spatiotemporal Datasets,” Proc. Symp. Large Spatial Databases (SSD), pp. 147164, 1999.
[48] V.J. Tsotras and N. Kangelaris, "The Snapshot Index: An I/OOptimal Access Method for Timeslice Queries," Information Systems, vol. 20, no. 3, pp. 237260, 1995.
[49] T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos, “Overlapping Linear Quadtrees: A SpatioTemporal Access Method,” Proc. ACMGeorgaphical Information Systems, pp. 17, 1998.
[50] M. Vazirgiannis, Y. Theodoridis, and T. Sellis, “SpatioTemporal Composition and Indexing for Large Multimedia Applications,” ACM/Springer Multimedia Systems, vol. 6, no. 4, pp. 284298, July 1998.
[51] P.J. Varman and R.M. Verma, "An Efficient Multiversion Access Structure," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 391409, May/June 1997.
[52] X. Xu, J. Han, and W. Lu, “RTTree: An Improved RTree Index Structure for Spatiotemporal Databases,” Proc. Int'l Symp. Spatial Data Handling (SDH), 1990.