Sciweavers

467 search results - page 12 / 94
» Processing top k queries from samples
Sort
View
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 7 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 4 months ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
ICDE
2009
IEEE
131views Database» more  ICDE 2009»
14 years 11 months ago
Exploring a Few Good Tuples from Text Databases
Information extraction from text databases is a useful paradigm to populate relational tables and unlock the considerable value hidden in plain-text documents. However, information...
Alpa Jain, Divesh Srivastava
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
14 years 2 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan
VLDB
1999
ACM
127views Database» more  VLDB 1999»
14 years 1 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano