Sciweavers

151 search results - page 8 / 31
» Efficient memory representation of XML document trees
Sort
View
DOCENG
2005
ACM
13 years 10 months ago
Enhancing composite digital documents using XML-based standoff markup
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...
Peter L. Thomas, David F. Brailsford
BDA
2004
13 years 10 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin
DASFAA
2009
IEEE
101views Database» more  DASFAA 2009»
14 years 3 months ago
Eager Evaluation of Partial Tree-Pattern Queries on XML Streams
Current streaming applications have stringent requirements on query response time and memory consumption because of the large (possibly unbounded) size of data they handle. Further...
Dimitri Theodoratos, Xiaoying Wu
NJC
2006
102views more  NJC 2006»
13 years 8 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
BDA
2004
13 years 10 months ago
Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...
Tuyet-Tram Dang-Ngoc, Georges Gardarin, Nicolas Tr...