Sciweavers

950 search results - page 9 / 190
» Evaluation over thousands of queries
Sort
View
SIGMOD
2002
ACM
145views Database» more  SIGMOD 2002»
14 years 7 months ago
Continuously adaptive continuous queries over streams
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance b...
Samuel Madden, Mehul A. Shah, Joseph M. Hellerstei...
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
MM
2006
ACM
168views Multimedia» more  MM 2006»
14 years 1 months ago
Scalability of local image descriptors: a comparative study
Computer vision researchers have recently proposed several local descriptor schemes. Due to lack of database support, however, these descriptors have only been evaluated using sma...
Herwig Lejsek, Friðrik Heiðar Ásmun...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 1 months ago
Containment of Conjunctive Queries over Databases with Null Values
Abstract. We study containment of conjunctive queries that are evaluated over databases that may contain tuples with null values. We assume the semantics of SQL for single block qu...
Carles Farré, Werner Nutt, Ernest Teniente,...
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
14 years 7 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...