Sciweavers

586 search results - page 35 / 118
» Ranking queries on uncertain data
Sort
View
IRI
2005
IEEE
14 years 1 months ago
A lattice framework for reusing top-k query results
Abstract)",4th Annual Walter Lincoln Hawkins Research Conference, RPI, November 2005. B. Hill, \Correlated Caching for Correlated Data", 2nd Annual Walter Lincoln Hawkins...
Brandeis Hill
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 9 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
13 years 8 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...