Sciweavers

151 search results - page 4 / 31
» Efficient memory representation of XML document trees
Sort
View
DATESO
2004
174views Database» more  DATESO 2004»
13 years 11 months ago
On Efficient Part-match Querying of XML Data
The XML language have been becoming de-facto a standard for representation of heterogeneous data in the Internet. From database point of view, XML is a new approach to data modelli...
Michal Krátký, Marek Andrt
JIDM
2010
155views more  JIDM 2010»
13 years 8 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months 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...
DEXA
2004
Springer
126views Database» more  DEXA 2004»
14 years 3 months ago
Detecting Content Changes on Ordered XML Documents Using Relational Databases
Abstract. Previous works in change detection on XML focused on detecting changes to text file using ordered and unordered tree model. These approaches are not suitable for detecti...
Erwin Leonardi, Sourav S. Bhowmick, T. S. Dharma, ...
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 4 months ago
Visually Exploring and Querying XML with BaseX
Abstract: XML documents are widely used as a generic container for textual contents. As they are increasingly growing in size, XML databases have come up to efficiently store and q...
Christian Grün, Alexander Holupirek, Marc H. ...