Sciweavers

43 search results - page 4 / 9
» Efficient vectorial operators for processing xml twig querie...
Sort
View
EDBTW
2006
Springer
13 years 10 months ago
Hash-Based Structural Join Algorithms
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 ...
Christian Mathis, Theo Härder
VLDB
2007
ACM
229views Database» more  VLDB 2007»
14 years 24 days ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
WWW
2008
ACM
14 years 7 months ago
Efficient evaluation of generalized path pattern queries on XML data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
Xiaoying Wu, Stefanos Souldatos, Dimitri Theodorat...
DATESO
2009
146views Database» more  DATESO 2009»
13 years 4 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas
COMAD
2008
13 years 8 months ago
Efficient Evaluation of Forward XPath Axes over XML Streams
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
Abdul Nizar, P. Sreenivasa Kumar