Integrating Similarity Based Retrieval and Query Refinement in Databases
Ortega-Binderberger, Michael
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81604
Description
Title
Integrating Similarity Based Retrieval and Query Refinement in Databases
Author(s)
Ortega-Binderberger, Michael
Issue Date
2002
Doctoral Committee Chair(s)
Sharad Mehrotra
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Library Science
Language
eng
Abstract
"With the emergence of many application domains that require imprecise similarity-based access to information, techniques to support such a retrieval paradigm over database systems have emerged as a critical area of research. There are two major areas to this search paradigm. The first one is how to interpret similarity search queries in a relational database context. We address this problem by extending relational operators to natively understand similarity-based retrieval and provide similarity operators that act on user-defined data-types. The second major research area is how to interactively improve the query through user interaction (query refinement). We address this problem by extending some information retrieval and machine learning techniques to affect the interpretation of similarity predicates and the query search condition itself. The result is a new query that better satisfies the users information need. The semantics of this domain favor a ""top-k"" retrieval approach where we only seek the best matching results for a query. We therefore developed for each of the two areas (similarity search and query refinement) several techniques to efficiently process queries. For similarity queries our query processing algorithms naturally support the top-k retrieval paradigm by returning the answers in order of their similarity to the query. For query refinement, our query processing algorithms reuse the results from previous queries to quickly answer the new refined queries. The algorithms avoid duplicating work done before and perform only the minimum work needed to return the next answer, thus resulting in up to an order of magnitude performance improvement over a naive re-execution of a refined query."
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
