Sciweavers

32 search results - page 5 / 7
» L-Tree: A Dynamic Labeling Structure for Ordered XML Data
Sort
View
144
Voted
DOCENG
2004
ACM
15 years 5 months ago
Querying XML documents by dynamic shredding
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
Hui Zhang 0003, Frank Wm. Tompa
WIDM
2004
ACM
15 years 5 months ago
Measuring similarity between collection of values
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
Carina F. Dorneles, Carlos A. Heuser, Andrei E. N....
TAPSOFT
1993
Springer
15 years 4 months ago
Exception Handling and Term Labelling
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
Gilles Bernot, Pascale Le Gall
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 17 days ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 2 days ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...