311 search results - page 16 / 63 » Approximate XML joins |
EDBTW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
ADC
2010
Springer
14 years 6 months ago
2010
Springer
Twig joins are key building blocks in current XML indexing systems, and numerous algorithms and useful data structures have been introduced. We give a structured, qualitative anal...
DASFAA
2007
IEEE
15 years 6 months ago
2007
IEEE
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, Tw...
ENTCS
2008
14 years 11 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
DASFAA
2007
IEEE
15 years 3 months ago
2007
IEEE
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...