Sciweavers

294 search results - page 34 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
168
Voted
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
15 years 11 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...
99
Voted
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 1 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
129
Voted
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ER
2008
Springer
123views Database» more  ER 2008»
14 years 11 months ago
Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
Lipyeow Lim, Haixun Wang, Min Wang
ADBIS
2005
Springer
147views Database» more  ADBIS 2005»
15 years 3 months ago
Declarative Data Fusion - Syntax, Semantics, and Implementation
In today’s integrating information systems data fusion, i.e., the merging of multiple tuples about the same real-world object into a single tuple, is left to ETL tools and other ...
Jens Bleiholder, Felix Naumann