Sciweavers

662 search results - page 73 / 133
» Trees, Automata and XML
Sort
View
LICS
1997
IEEE
15 years 9 months ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin
139
Voted
EXTREME
2004
ACM
15 years 11 months ago
Half-steps toward LMNL
Overlap in markup occurs where some markup structures do not nest, such as where the sentence and phrase boundaries of a poem and the metrical line structure describe different hi...
Wendell Piez
203
Voted
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
16 years 6 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
DEXA
2009
Springer
127views Database» more  DEXA 2009»
16 years 20 days ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
16 years 7 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...