Sciweavers

Share
552 search results - page 2 / 111
» On the Complexity of Join Predicates
Sort
View
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
12 years 6 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
12 years 7 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...
PVLDB
2010
103views more  PVLDB 2010»
11 years 4 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
EDBT
1994
ACM
149views Database» more  EDBT 1994»
11 years 10 months ago
On the Estimation of Join Result Sizes
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
Arun N. Swami, K. Bernhard Schiefer
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
11 years 11 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
books