Sciweavers

147 search results - page 7 / 30
» Size Bounds and Query Plans for Relational Joins
Sort
View
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
14 years 8 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...
PVLDB
2010
123views more  PVLDB 2010»
13 years 5 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...
DEXA
2006
Springer
151views Database» more  DEXA 2006»
13 years 9 months ago
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS
Geographic information systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding exact answers to spatial queries can be very time consum...
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 7 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 8 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...