Sciweavers

294 search results - page 5 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
CIKM
2010
Springer
14 years 7 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
155
Voted
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
15 years 10 months ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su
DAMON
2008
Springer
14 years 11 months ago
DSM vs. NSM: CPU performance tradeoffs in block-oriented query processing
Comparisons between the merits of row-wise storage (NSM) and columnar storage (DSM) are typically made with respect to the persistent storage layer of database systems. In this pa...
Marcin Zukowski, Niels Nes, Peter A. Boncz
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
15 years 9 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
CIKM
2006
Springer
15 years 1 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...