Sciweavers

2067 search results - page 38 / 414
» Modeling and exploiting query interactions in database syste...
Sort
View
CIKM
2010
Springer
15 years 2 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 4 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
VLDB
1994
ACM
153views Database» more  VLDB 1994»
15 years 8 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
VLDB
1991
ACM
196views Database» more  VLDB 1991»
15 years 7 months ago
Kaleidoscope Data Model for An English-like Query Language
Most database interfaces provide poor guidance on ad hoc query formulation, burdening users to learn, and to recall precisely the query language and the database. Kaleidoscope avo...
Sang Kyun Cha, Gio Wiederhold
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 6 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli