Sciweavers

219 search results - page 2 / 44
» Intensional Query Answering: An Application of Partial Evalu...
Sort
View
EDBT
2009
ACM
127views Database» more  EDBT 2009»
13 years 11 months ago
Answering aggregate keyword queries on relational databases using minimal group-bys
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
Bin Zhou 0002, Jian Pei
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 6 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
11 years 7 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
14 years 6 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi
DASFAA
2009
IEEE
101views Database» more  DASFAA 2009»
13 years 11 months ago
Eager Evaluation of Partial Tree-Pattern Queries on XML Streams
Current streaming applications have stringent requirements on query response time and memory consumption because of the large (possibly unbounded) size of data they handle. Further...
Dimitri Theodoratos, Xiaoying Wu