Sciweavers

311 search results - page 17 / 63
» Approximate XML joins
Sort
View
CIKM
2004
Springer
15 years 5 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
VLDB
2004
ACM
126views Database» more  VLDB 2004»
15 years 5 months ago
ROX: Relational Over XML
An increasing percentage of the data needed by business applications is being generated in XML format. Storing the XML in its native format will facilitate new applications that e...
Alan Halverson, Vanja Josifovski, Guy M. Lohman, H...
WWW
2008
ACM
16 years 11 days ago
Extracting XML schema from multiple implicit xml documents based on inductive reasoning
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
Masaya Eki, Tadachika Ozono, Toramatsu Shintani
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
15 years 6 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
FOIKS
2008
Springer
15 years 1 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye