Sciweavers

29 search results - page 2 / 6
» Best Position Algorithms for Top-k Queries
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 4 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 ...
CCR
2006
117views more  CCR 2006»
13 years 4 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
VLDB
2004
ACM
120views Database» more  VLDB 2004»
13 years 10 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 5 months ago
Identifying "best bet" web search results by mining past user behavior
The top web search result is crucial for user satisfaction with the web search experience. We argue that the importance of the relevance at the top position necessitates special h...
Eugene Agichtein, Zijian Zheng
MTA
2007
141views more  MTA 2007»
13 years 4 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...