Sciweavers

2850 search results - page 473 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 6 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
15 years 5 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...
DASFAA
2006
IEEE
92views Database» more  DASFAA 2006»
15 years 5 months ago
Document Decomposition for XML Compression: A Heuristic Approach
Sharing of common subtrees has been reported useful not only for XML compression but also for main-memory XML query processing. This method compresses subtrees only when they exhib...
Byron Choi
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
15 years 6 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
FQAS
2004
Springer
135views Database» more  FQAS 2004»
15 years 5 months ago
Interactive Schema Integration with Sphinx
Abstract. The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repo...
François Barbançon, Daniel P. Mirank...