Sciweavers

1091 search results - page 153 / 219
» Approximation in Databases
Sort
View
VLDB
2005
ACM
106views Database» more  VLDB 2005»
16 years 3 days ago
Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
Reynold Cheng, Ben Kao, Sunil Prabhakar, Alan Kwan...
VLDB
2005
ACM
226views Database» more  VLDB 2005»
16 years 3 days ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
VLDB
2005
ACM
115views Database» more  VLDB 2005»
16 years 3 days ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
CIKM
2004
Springer
16 years 1 days ago
Indexing text data under space constraints
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
Bijit Hore, Hakan Hacigümüs, Balakrishna...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
15 years 12 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras