東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Integrating similarity based retriev...

Ortega-Binderberger, Michael.

FindBook

Google Book

Amazon

博客來

Integrating similarity based retrieval and query refinement in databases.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Integrating similarity based retrieval and query refinement in databases./
作者:	Ortega-Binderberger, Michael.
面頁冊數:	169 p.
附註:	Source: Dissertation Abstracts International, Volume: 63-11, Section: B, page: 5339.
Contained By:	Dissertation Abstracts International63-11B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3070037
ISBN:	0493899804

Integrating similarity based retrieval and query refinement in databases.
Ortega-Binderberger, Michael.

Integrating similarity based retrieval and query refinement in databases. - 169 p.

Source: Dissertation Abstracts International, Volume: 63-11, Section: B, page: 5339.

Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.

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.

ISBN: 0493899804Subjects--Topical Terms:

626642
Computer Science.

Integrating similarity based retrieval and query refinement in databases.
LDR:02636nmm 2200277 4500 001 1849350
005 20051206073022.5
008 130614s2002 eng d
020 $a 0493899804
035 $a (UnM)AAI3070037
035 $a AAI3070037
040 $a UnM $c UnM
100 1 $a Ortega-Binderberger, Michael. $3 1937312
245 1 0 $a Integrating similarity based retrieval and query refinement in databases.
300 $a 169 p.
500 $a Source: Dissertation Abstracts International, Volume: 63-11, Section: B, page: 5339.
500 $a Adviser: Sharad Mehrotra.
502 $a Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.
520 $a 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.
590 $a School code: 0090.
650 4 $a Computer Science. $3 626642
650 4 $a Library Science. $3 881164
690 $a 0984
690 $a 0399
710 2 0 $a University of Illinois at Urbana-Champaign. $3 626646
773 0 $t Dissertation Abstracts International $g 63-11B.
790 1 0 $a Mehrotra, Sharad, $e advisor
790 $a 0090
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3070037