Sciweavers

493 search results - page 39 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
WWW
2002
ACM
15 years 11 months ago
Probabilistic query expansion using query logs
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
Hang Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma
100
Voted
PVLDB
2010
123views more  PVLDB 2010»
14 years 9 months ago
Toward Scalable Keyword Search over Relational Data
Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing ...
Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Je...
PVLDB
2010
84views more  PVLDB 2010»
14 years 9 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
SIGMOD
2003
ACM
171views Database» more  SIGMOD 2003»
15 years 11 months ago
Adaptive Filters for Continuous Queries over Distributed Data Streams
We consider an environment where distributed data sources continuously stream updates to a centralized processor that monitors continuous queries over the distributed data. Signif...
Chris Olston, Jing Jiang, Jennifer Widom
92
Voted
EDBT
2006
ACM
194views Database» more  EDBT 2006»
15 years 11 months ago
On Concurrency Control in Sliding Window Queries over Data Streams
Abstract. Data stream systems execute a dynamic workload of longrunning and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, window...
Lukasz Golab, Kumar Gaurav Bijay, M. Tamer Öz...