Sciweavers

221 search results - page 5 / 45
» Structure and Value Synopses for XML Data Graphs
Sort
View
173
Voted
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
15 years 11 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
98
Voted
DASFAA
2011
IEEE
206views Database» more  DASFAA 2011»
14 years 1 months ago
A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML
Abstract. Uncertainty is inherently ubiquitous in data of real applications, and those uncertain data can be naturally represented by the XML. Matching twig pattern against XML dat...
Bo Ning, Chengfei Liu
79
Voted
JSS
2008
139views more  JSS 2008»
14 years 10 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
96
Voted
INEX
2005
Springer
15 years 3 months ago
Clustering XML Documents Using Self-organizing Maps for Structures
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
85
Voted
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
15 years 3 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....