Sciweavers

808 search results - page 9 / 162
» On the Estimation of Join Result Sizes
Sort
View
JIIS
2006
76views more  JIIS 2006»
14 years 9 months ago
Holes in joins
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
Jarek Gryz, Dongming Liang
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
15 years 1 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 4 months ago
Join Optimization of Information Extraction Output: Quality Matters!
— Information extraction (IE) systems are trained to extract specific relations from text databases. Real-world applications often require that the output of multiple IE systems...
Alpa Jain, Panagiotis G. Ipeirotis, AnHai Doan, Lu...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
15 years 9 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, ...
WWW
2007
ACM
15 years 10 months ago
Estimating the cardinality of RDF graph patterns
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is ...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...