skip to main content
article

Approximate spatio-temporal retrieval

Published:01 January 2001Publication History
Skip Abstract Section

Abstract

This paper proposes a framework for the handling of spatio-temporal queries with inexact matches, using the concept of relation similarity. We initially describe a binary string encoding for 1D relations that permits the automatic derivation of similarity measures. We then extend this model to various granularity levels and many dimensions, and show that reasoning on spatio-temporal structure is significantly facilitated in the new framework. Finally, we provide algorithms and optimization methods for four types of queries: (i) object retrieval based on some spatio-temporal relations with respect to a reference object, (ii) spatial joins, i.e., retrieval of object pairs that satisfy some input relation, (iii) structural queries, which retrieve configurations matching a particular spatio-temporal structure, and (iv) special cases of motion queries. Considering the current large availability of multidimensional data and the increasing need for flexible query-answering mechanisms, our techniques can be used as the core of spatio-temporal query processors.

References

  1. ADAM,N.AND YESHA, Y. 1996. Strategic directions in electronic commerce and digital libraries: Towards a digital agora. ACM Comput. Surv. 28, 4, 818-835. Google ScholarGoogle Scholar
  2. ALLEN, J. F. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26,11 (Nov.), 832-843. Google ScholarGoogle Scholar
  3. ARGE, L., PROCOPIUC, O., RAMASWAMY, S., SUEL, T., AND VITTER, J. S. 1996. Scalable sweeping-based spatial join. In Proceedings of the 21st Conference on VLDB (Zurich, Switzerland). VLDB Endowment, Berkeley, CA, 570-581. Google ScholarGoogle Scholar
  4. BACCHUS,F.AND GROVE, A. 1995. On the forward checking algorithm. In Proceedings of the International Conference on Principles and Practice of Constraint Programming. 292-308. Google ScholarGoogle Scholar
  5. BACCHUS,F.AND VAN RUN, P. 1995. Dynamic variable ordering in CSPs. In Proceedings of the International Conference on Principles and Practice of Constraint Programming. 258-275. Google ScholarGoogle Scholar
  6. BECKMANN, N., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1990. The R-tree: An efficient and robust access method for points and rectangles. SIGMOD Rec. 19, 2 (Jun.), 322-331. Google ScholarGoogle Scholar
  7. BERCHTOLD, S., ERTL, B., KEIM,D.A.,KRIEGEL, H. -P., AND SEIDL, T. 1997. Fast nearest neighbor search in high-dimensional space. In Proceedings of the 1997 Conference on ICDE. 209-218. Google ScholarGoogle Scholar
  8. BUREAU OF THE CENSUS. 1994. TIGER/Line files. Bureau of the Census, Washington DC.Google ScholarGoogle Scholar
  9. BRINKHOFF, T., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1994. Multi-step processing of spatial joins. SIGMOD Rec. 23, 2 (June), 197-208. Google ScholarGoogle Scholar
  10. BRINKHOFF, T., KRIEGEL, H.-P., AND SEEGER, B. 1993. Efficient processing of spatial joints using R-trees. SIGMOD Rec. 22, 2 (June 1), 237-246. Google ScholarGoogle Scholar
  11. BRINKHOFF, T., KRIEGEL, H. -P., AND SEEGER, B. 1997. Parallel processing of spatial joins using R-trees. In Proceedings of the 1997 Conference on ICDE. 258-265. Google ScholarGoogle Scholar
  12. BRUNS,T.AND EGENHOFER, M. 1996. Similarity of spatial scenes. In Proceedings of the Conference on Spatial Data Handling (Delft, The Netherlands), M.-J. Kraak and M. Molenaar, Eds. 31-42.Google ScholarGoogle Scholar
  13. CHANG, S., JUNGERT, E., AND LI, T. 1989. Representation and retrieval of symbolic pictures using generalized 2D strings. In Proceedings of the Conference on SPIE Visual Communications and Image Processing IV. 1360-1372.Google ScholarGoogle Scholar
  14. CHANG, S. -F., CHEN, W., MENG,H.J.,SUNDARAM, H., AND ZHONG, D. 1998. A fully automatic content-based video search engine supporting multi-object spatio-temporal queries. IEEE Trans. Circuits Syst. Video Technol. 8, 5 (Sept.), 602-615. Google ScholarGoogle Scholar
  15. CHANG, S., SHI, Q., AND YAN, C. 1987. Iconic indexing by 2-D String. IEEE Trans. Pattern Anal. Mach. Intell. 9, 3, 413-428. Google ScholarGoogle Scholar
  16. EGENHOFER,M.J.AND AL-TAHA, K. 1992. Reasoning about gradual changes of topological relations. In International Conference GIS: From Space to Territory. Springer-Verlag, New York, NY, 196-219. Google ScholarGoogle Scholar
  17. FALOUTSOS, C., BARBER, R., FLICKNER, M., HAFNER, J., NIBLACK, W., PETKOVIC, D., AND EQUITZ, W. 1994. Efficient and effective querying by image content. J. Intell. Inf. Syst. 3, 3/4 (July), 231-262. Google ScholarGoogle Scholar
  18. FREKSA, C. 1992. Temporal reasoning based on semi-intervals. Artif. Intell. 54, 1-2 (Mar.), 199-227. Google ScholarGoogle Scholar
  19. GUDIVADA,V.N.AND RAGHAVAN, V. V. 1995. Design and evaluation of algorithms for image retrieval by spatial similarity. ACM Trans. Inf. Syst. 13, 2 (Apr.), 115-144. Google ScholarGoogle Scholar
  20. GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Annual Meeting on Management of Data (SIGMOD '84, Boston, MA, June18-21). ACM, New York, NY, 47-57. Google ScholarGoogle Scholar
  21. HARALICK,R.M.AND ELLIOTT, G. L. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263-313.Google ScholarGoogle Scholar
  22. HERNANDEZ, D. 1994. Qualitative Representation of Spatial Knowledge. Springer-Verlag, New York, NY. Google ScholarGoogle Scholar
  23. HUANG, Y. -W., JING, N., AND RUNDENSTEINER, E. 1997. Spatial joins using R-trees: Breadth first traversal with global optimizations. In Proceedings of the 23rd Conference on VLDB (Athens, Greece, Aug.). VLDB Endowment, Berkeley, CA, 396-405. Google ScholarGoogle Scholar
  24. KOUDAS,N.AND SEVCIK, K. 1994. Size separation spatial join. In Proceedings of the 1994 ACM Conference on SIGMOD (Minneapolis, MN, May). ACM Press, New York, NY, 324-335. Google ScholarGoogle Scholar
  25. LEE, S.-Y. AND HSU, F.-J. 1992. Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation. Pattern Recogn. 25, 3 (Mar.), 305-318. Google ScholarGoogle Scholar
  26. LEE, S., YANG, M., AND CHEN, J. 1992. Signature file as a spatial filter for iconic image database. J. Visual Lang. Comput. 3, 4, 373-397.Google ScholarGoogle Scholar
  27. LO, M.-L. AND RAVISHANKAR, C. V. 1994. Spatial joins using seeded trees. SIGMOD Rec. 23,2 (June), 209-220. Google ScholarGoogle Scholar
  28. LO, M.-L. AND RAVISHANKAR, C. V. 1996. Spatial hash-joins. SIGMOD Rec. 25, 2, 247-258. Google ScholarGoogle Scholar
  29. MAMOULIS,N.AND PAPADIAS, D. 1999. Integration of spatial join algorithms for processing multiple inputs. SIGMOD Rec. 28, 1 (Mar.), 1-12. Google ScholarGoogle Scholar
  30. MAYBURY,M.T.,ED. 1997. Intelligent Multimedia Information Retrieval. MIT Press, Cambridge, MA. Google ScholarGoogle Scholar
  31. MISHRA,P.AND EICH, M. H. 1992. Join processing in relational databases. ACM Comput. Surv. 24, 1 (Mar.), 63-113. Google ScholarGoogle Scholar
  32. NABIL, M., NGU, A., AND SHEPHERD, J. 1996. Picture similarity retrieval using 2d projection interval representation. IEEE Trans. Knowl. Data Eng. 8, 4 (Aug.), 533-539. Google ScholarGoogle Scholar
  33. NADEL, B. A. 1990. Constraint satisfaction algorithms. Comput. Intell. 5, 4 (Nov.), 188-224. Google ScholarGoogle Scholar
  34. STONEBRAKER, M. 1995. Chabot: Retrieval from a relational database of images. IEEE Computer 28,9,40-48. Google ScholarGoogle Scholar
  35. ORENSTEIN, J. A. 1986. Spatial query processing in an object-oriented database system. SIGMOD Rec. 15, 2 (June), 326-336. Google ScholarGoogle Scholar
  36. PAPADIAS,D.AND THEODORIDIS, Y. 1997. Spatial relations, minimum bounding rectangles, and spatial data structures. Int. J. Geograph. Inf. Syst. 11, 2, 111-138.Google ScholarGoogle Scholar
  37. PAPADIAS, D., MAMOULIS, N., AND THEODORIDIS, Y. 1999. Processing and optimization of multiway spatial joins using R-trees. In Proceedings of the Conference on ACM PODS. 44-55. Google ScholarGoogle Scholar
  38. PAPADIAS, D., MANTZOUROGIANNIS, M., KALNIS, P., MAMOULIS, N., AND AHMAD, I. 1992. Content-based retrieval using heuristic search. In Proceedings on ACM SIGIR. ACM Press, New York, NY, 168-175. Google ScholarGoogle Scholar
  39. PAPADIAS, D., THEODORIDIS, Y., SELLIS, T., AND EGENHOFER, M. 1994. Topological relations in the world of minimum bounding rectangles: A study with R-trees. In Proceedings of the 1994 ACM Conference on SIGMOD (Minneapolis, MN, May). ACM Press, New York, NY, 92-103. Google ScholarGoogle Scholar
  40. PARK, H., CHA, G., AND CHUNG, J. M. 1999. Multiway spatial joins using R-trees: Methodology and performance evaluation. In Proceedings of the 6th International Symposium on Spatial Databases. 229-250. Google ScholarGoogle Scholar
  41. PATEL,J.M.AND DEWITT, D. J. 1996. Partition based spatial-merge join. SIGMOD Rec. 25,2, 259-270. Google ScholarGoogle Scholar
  42. PETRAKIS,E.AND FALOUTSOS, C. 1997. Similarity searching in medical image databases. IEEE Trans. Knowl. Data Eng. 9, 3 (May/June), 435-447. Google ScholarGoogle Scholar
  43. PREPARATA,F.P.AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer Texts and Monographs in Computer Science. Springer-Verlag, New York, NY. Google ScholarGoogle Scholar
  44. ROTEM, D. 1991. Spatial join indices. In Proceedings of the Conference on ICDE. 500-509. Google ScholarGoogle Scholar
  45. ROUSSOPOULOS, N., KELLEY, S., AND VINCENT, F. 1995. Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD '95, San Jose, CA, May 23-25), M. Carey and D. Schneider, Eds. ACM Press, New York, NY, 71-79. Google ScholarGoogle Scholar
  46. SEIDL,T.AND KRIEGEL, H. -P. 1997. Efficient user-adaptable similarity search in large multimedia databases. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB '97, Athens, Greece, Aug.). 506-515. Google ScholarGoogle Scholar
  47. SMITH,J.AND CHANG, S. 1996. Searching for images and videos on the world-wide web. CU/CTR 459-96-25.Google ScholarGoogle Scholar
  48. SELLIS, T., ROUSSOPOULOS, N., AND FALOUTSOS, C. 1987. The R1-tree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th Confererence on Very Large Data Bases (Brighton, England, Sept.). VLDB Endowment, Berkeley, CA, 507-518. Google ScholarGoogle Scholar
  49. VALDURIEZ, P. 1987. Join indices. ACM Trans. Database Syst. 12, 2 (June), 218-246. Google ScholarGoogle Scholar
  50. VAZIRGIANNIS, M., THEODORIDIS, Y., AND SELLIS, T. 1998. Spatio-temporal composition and indexing for large multimedia applications. Multimedia Syst. 6, 4, 284-298. Google ScholarGoogle Scholar

Index Terms

  1. Approximate spatio-temporal retrieval

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Information Systems
            ACM Transactions on Information Systems  Volume 19, Issue 1
            Jan. 2001
            96 pages
            ISSN:1046-8188
            EISSN:1558-2868
            DOI:10.1145/366836
            Issue’s Table of Contents

            Copyright © 2001 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 January 2001
            Published in tois Volume 19, Issue 1

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader