Sciweavers

327 search results - page 16 / 66
» XML Tree Structure Compression
Sort
View
FOSSACS
2009
Springer
14 years 1 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
DATESO
2009
158views Database» more  DATESO 2009»
13 years 4 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
IDEAS
2005
IEEE
111views Database» more  IDEAS 2005»
14 years 10 days ago
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
Theodore Dalamagas, Dimitri Theodoratos, Antonis K...
DCC
2010
IEEE
14 years 1 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Simon Gog, Johannes Fischer
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 8 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...