Sciweavers

134 search results - page 13 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 7 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen
IDEAS
2006
IEEE
108views Database» more  IDEAS 2006»
14 years 1 months ago
XML Document Correction: Incremental Approach Activated by Schema Validation
Updating XML documents submitted to schema constraints requires incremental validation, i.e. checking the parts of the document concerned by the updates. We propose to correct sub...
Béatrice Bouchou, Ahmed Cheriat, Mirian Hal...
IS
2008
13 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
XIMEP
2004
ACM
74views Database» more  XIMEP 2004»
14 years 22 days ago
Schema Validation and Type Annotation for Encoded Trees
We argue that efficient support for schema validation and type annotation in XQuery processors deserves as much attention as efficient evaluation techniques for XPath queries have...
Torsten Grust, Stefan Klinger
WWW
2007
ACM
14 years 8 months ago
Visibly pushdown automata for streaming XML
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan