Advertisement

Multimedia Tools and Applications

, Volume 24, Issue 3, pp 197–214 | Cite as

Ranked Relations: Query Languages and Query Processing Methods for Multimedia

  • Sibel Adali
  • Corey Bufi
  • Maria-Luisa Sapino
Article

Abstract

In this paper, we describe the notion of a ranked relation that incorporates to the relational data model the notion of rank, i.e. ordering among tuples or objects. The ordering of tuples may be based on a single rank information, or multiple ranks combined together. We show that such relations arise naturally in many applications, especially in applications that query outside sources and return ranked relations as answers to content based queries. We introduce an algebra for querying ranked relations and give examples of its use for various applications. We then prove various properties of the algebra with special emphasis on the preservation of the coherence property, which shows when different rank columns are guaranteed to induce the same ordering among tuples. We show how these properties can be used to produce approximate early returns. Finally, we give experimental results based on Internet search engines for our early returns method and show that our method provides meaningful and fast answers to the user.

information integration meta-search relational algebra early returns 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Adali, P. Bonatti, M.L. Sapino, and V.S. Subrahmanian, "A multi-similarity algebra," in Proc. of SIGMOD, L. Haas and A. Tiwary (Eds.), pp. 402-413.Google Scholar
  2. 2.
    S. Adali and C. Bufi, "A flexible architecture for query integration and mapping," in Proc. of Third IFCIS Conference on Cooperative Information Systems (COOPIS98), J. Mylopoulos and A. Solvberg (Eds.), pp. 341-351.Google Scholar
  3. 3.
    R. Agrawal and E. Wimmers, "A framework for expressing and combining preferences," in Proc. of ACM SIGMOD, 2000, pp. 297-306.Google Scholar
  4. 4.
    G.O. Arocena, A.O. Mendelzon, and G.A. Mihaila, Query Languages for the Web. QL 1998.Google Scholar
  5. 5.
    P.A Bonatti, M.L. Sapino, and V.S. Subrahmanian, "Merging heterogeneous security orderings," Journal of Computer Security, Vol. 5, No. 1, pp. 3-29, 1997.Google Scholar
  6. 6.
    N. Bruno, S. Chaudhuri, and L. Gravano, "Top-k selection queries over relational databases: Mapping strategies and performance evaluation," TODS, Vol. 27, No. 2, pp. 153-187, 2002.Google Scholar
  7. 7.
    K.S. Candan and W.S. Li, "On similarity measures for multimedia database applications," Technical Report, C & C Research Laboratories, NEC USA, Inc.Google Scholar
  8. 8.
    M.J. Carey, L.M. Haas, P.M. Schwarz, M. Arya, W.F. Cody, R. Fagin, M. Flickner, A.W. Luniewski, W. Niblack, D. Petkovic, J. Thomas, J.H. Williams, and E.L. Wimmers, "Towards heterogeneous multimedia information systems: The garlic approach," in Proceedings of the Fifth International Workshop on Research Issues in Data Engineering(RIDE): Distributed Object Management, 1995, pp. 124-131.Google Scholar
  9. 9.
    U. Cetintemel, M.J. Franklin, and C. Lee Giles, "Self-adaptive user profiles for large-scale data delivery," in Proceedings of ICDE, 2000, pp. 622-633.Google Scholar
  10. 10.
    C.-C. K. Chang and H. Garcia-Molina, "Mind your vocabulary: Query mapping across heterogeneous information sources," in Proceedings of SIGMOD Conference, 1999, pp. 335-346.Google Scholar
  11. 11.
    K. Chang and S.-W. Huang, "Minimal probing: Supporting expressive predicates for top-k queries," in Proc. of ACM SIGMOD, 2002, pp. 346-357.Google Scholar
  12. 12.
    S. Chaudhuri, G. Das, and V. Narasayya, "A robust, optimization-based approach for approximate answering of aggregate queries," in Proceedings of ACM SIGMOD, Santa Barbara, USA.Google Scholar
  13. 13.
    D. Donjerkovic and R. Ramakrishnan, "Probabilistic optimization of top N queries," in Proc. of VLDB, 1999, pp. 411-422.Google Scholar
  14. 14.
    C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, "Rank aggregation methods for the web," in Proceedings of the International WWW Conference, pp. 613-622.Google Scholar
  15. 15.
    R. Fagin, "Combining fuzzy information from multiple systems," Journal of Computer and System Sciences, pp. 83-99, 1999.Google Scholar
  16. 16.
    Y. Freund, R. Iyer, R.E. Schapire, and Y. Singer, "An efficient boosting algorithm for combining preferences," in Machine Learning: Proceedings of the Fifteenth International Conference, 1998.Google Scholar
  17. 17.
    I. Ilyas, W. Aref, and A. Elmagarmid, "Joining ranked inputs in practice," in Proceedings of VLDB, 2002.Google Scholar
  18. 18.
    M. Kleinberg, "Authoritative sources in a hyperlinked environment," JACM, Vol. 46, No. 5, pp. 604-632, 1999.Google Scholar
  19. 19.
    A.Y. Levy, A. Rajaraman, and J.J. Ordille, "Querying heterogeneous information sources using source descriptions," in Proceedings of the VLDB, 1996, pp. 251-262.Google Scholar
  20. 20.
    W. Meng, C. Yu, and K. Liu, "Building efficient and effective metasearch engines," ACMComputing Surveys, Vol. 34, No. 1, pp. 48-89, 2002.Google Scholar
  21. 21.
    L. Si and J. Callan, "Using sampled data and regression to merge search engine results," in Proceedings of the SIGIR Conference on Information Retrieval, 2002.Google Scholar
  22. 22.
    P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, and D. Srivastava, "Ranked join indices," in Proc. of ICDE2003Google Scholar
  23. 23.
    V. Vassalos and Y. Papakonstantinou, "Expressive capabilities description languages and query rewritingalgorithms," Journal of Logic Programming, Vol. 43, No. 1, pp. 75-122, 2000.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Sibel Adali
    • 1
  • Corey Bufi
    • 2
  • Maria-Luisa Sapino
    • 3
  1. 1.Computer Science DepartmentRensselaer Polytechnic InstituteTroy
  2. 2.GE Global ResearchNiskayuna
  3. 3.Dipartimento di InformaticaUniversità di TorinoTorinoItaly.

Personalised recommendations