skip to main content
10.1145/276304.276340acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

A multi-similarity algebra

Published:01 June 1998Publication History

ABSTRACT

The need to automatically extract and classify the contents of multimedia data archives such as images, video, and text documents has led to significant work on similarity based retrieval of data. To date, most work in this area has focused on the creation of index structures for similarity based retrieval. There is very little work on developing formalisms for querying multimedia databases that support similarity based computations and optimizing such queries, even though it is well known that feature extraction and identification algorithms in media data are very expensive. We introduce a similarity algebra that brings together relational operators and results of multiple similarity implementations in a uniform language. The algebra can be used to specify complex queries that combine different interpretations of similarity values and multiple algorithms for computing these values. We prove equivalence and containment relationships between similarity algebra expressions and develop query rewriting methods based on these results. We then provide a generic cost model for evaluating cost of query plans in the similarity algebra and query optimization methods based on this model. We supplement the paper with experimental results that illustrate the use of the algebra and the effectiveness of query optimization methods using the Integrated Search Engine (I.SEE) as the testbed.

References

  1. 1.S. Adall, C. Buff and Y. Temtanapat. "Integrated Search Engine", to appear in the Proc. of i997 IEEE Knowledge and Data Engineering Exchange Workshop, KI)~3X'97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.S. Adatl, K.S. Candan, Y. Papakonstantinou and V.S. Subrahmanian. "Query Caching and Optimization in Distributed Mediator Systems", Proc. of the 1996 Sigmod Conference on Management of Data, pp. 137 - 148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.M. Arya, W. Cody, C. Faloutsos, J. Richardson and A. Toga. (1995) "Design and Implementation of QBISM, a 3D Medical Image Database System", in: (V.S. Subrahmanian and S. Jajodia, eds.) "Multimedia Database Systems: Issues and Research Directions", Springer 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.S. Berchtold, D. A. Keim, and Hans-Peter Kriegel. (1996) "The X-tree : An Index Structure for tIigh-Dimensional Data", Proc. 1996 Intl. Conf. on Very Large Databases, Bombay, India, pps 28-39. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.T. Blum, D. Keislar, J. Wheaton and E. Wold. (1995) "Audio Databases with Content-based Retrieval", Proc. 1995 IJCAI workshop on Intelligent Multimedia Information Retrieval, Montreal, Canada. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.E.W. Brown, J.P. Callan and W. B. Crof. (1994) "Fast incremental Indexing for Pull-Text Information retrieval", Proc. 1994 Intl. Conf. on Very Large databases, Santiago, Chile, pps, 192-202. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.M. J. Carey and D. Kossmann (1997) "On Saying "Enough Already!" in SQL." Proceedings of the 1997 Sigmod Conference on Management of Data, pp. 219-230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.S. Chaudhuri and L. Gravano. (1996) "Optimizing Queries over Multimedia Repositories", Proc. 1996 ACM SIGMOD Conf. on Management of Data, pps 91-102. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.C. Faloutsos. (1996) "Searching Multimedia Databases by Content", Kluwer Academic Publishers. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.L. Gravano, C. Chang, H. Garcia-Molina and A. Paepcke. "STARTS: Stanford Proposal for Internet Meta- Searching", SIGMOD 1997, pp. 207-218. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.V.N. Gudivada and V.V. Raghavan. (1993) "Design and Evaluation of Algorithms for Image Retrieval by Spatial Similarity", ACM Transactions on Information Systems, 13,1, pps 115-144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.H. V. Jagadish, A. Mendelzon and T. Milo. "Similarity- Based Queries", Proc. of ACM PODS 1995, pp. 36-45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.K.-I. Lin, H.V. Jagadish and C. Faloutsos. (1994) "The TV-Tree: An Index Structure for High-dimensional Data", VLDB Journal, 3, pps 517-542. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.W. Niblack, et. al. (1993) "The QBIC Project: Querying Images by Content Using Color, Texture and Shape", IBM Research Report, Feb. 1993.Google ScholarGoogle ScholarCross RefCross Ref
  15. 15.S. Santini and R. Jain. (1996) "Similarity Matching", to appear in: IEEE Transactions on Pattern Analysis and Machine Intelligence.Google ScholarGoogle Scholar
  16. 16.X. Qian. "Query folding." In Proceedings of the Twelfth International Conference on Data Enginnering, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.A. Tomasic, H. Garcia-Molina and K. Shoens. (1994) "Incremental Updates of Inverted Lists for Text Retrieval", Proc. 1994 ACM SIGMOD Conf. on Management of Data, Minneapolis, pps 289--300. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A multi-similarity algebra

          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
          • Published in

            cover image ACM Conferences
            SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data
            June 1998
            599 pages
            ISBN:0897919955
            DOI:10.1145/276304

            Copyright © 1998 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 June 1998

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate785of4,003submissions,20%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader