Sciweavers

785 search results - page 42 / 157
» Binary Join Trees
Sort
View
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
15 years 1 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CORR
2008
Springer
120views Education» more  CORR 2008»
14 years 9 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
GVD
2003
151views Database» more  GVD 2003»
14 years 11 months ago
Bridging the GAP Between Relational and Native XML Storage with Staircase Join
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
Jens Teubner, Torsten Grust, Maurice van Keulen
CIKM
2009
Springer
15 years 1 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
15 years 1 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski