Structural XML query processing
Since the boom in new proposals on techniques for efficient querying of XML data is now
over and the research world has shifted its attention toward new types of data formats, we …
over and the research world has shifted its attention toward new types of data formats, we …
A survey of XML tree patterns
M Hachicha, J Darmont - IEEE Transactions on Knowledge …, 2011 - ieeexplore.ieee.org
With XML becoming a ubiquitous language for data interoperability purposes in various
domains, efficiently querying XML data is a critical issue. This has lead to the design of …
domains, efficiently querying XML data is a critical issue. This has lead to the design of …
Fast optimal twig joins
N Grimsmo, TA Bjørklund, ML Hetland - Proceedings of the VLDB …, 2010 - dl.acm.org
In XML search systems twig queries specify predicates on node values and on the structural
relationships between nodes, and a key operation is to join individual query node matches …
relationships between nodes, and a key operation is to join individual query node matches …
Systematic partitioning and labeling XML subtrees for efficient processing of XML queries in IoT environments
With the advent of IoT, storing, indexing and querying XML data efficiently is critical. To
minimize the cost of querying XML data, researchers have proposed many indexing …
minimize the cost of querying XML data, researchers have proposed many indexing …
Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings
Searching for occurrences of a twig pattern query (TPQ) in an XML document is a core task
of all XML database query languages. The generalized twig pattern (GTP) extends the TPQ …
of all XML database query languages. The generalized twig pattern (GTP) extends the TPQ …
On the efficiency of a prefix path holistic algorithm
In recent years, many approaches to XML twig pattern searching have been developed.
Holistic approaches such as TwigStack are particularly significant in that they provide a …
Holistic approaches such as TwigStack are particularly significant in that they provide a …
TJDewey–on the efficient path labeling scheme holistic approach
In recent years, many approaches to XML twig pattern searching have been developed.
Holistic approaches are particularly significant in that they provide a theoretical model for …
Holistic approaches are particularly significant in that they provide a theoretical model for …
Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees
N Grimsmo, TA Bjørklund, ML Hetland - Database and XML Technologies …, 2010 - Springer
The F&B-index is used to speed up pattern matching in tree and graph data, and is based on
the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has …
the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has …
[PDF][PDF] Towards unifying advances in twig join algorithms.
N Grimsmo, TA Bjørklund - ADC, 2010 - Citeseer
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 …
algorithms and useful data structures have been introduced. We give a structured …