Sciweavers

479 search results - page 4 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
DEXA
2006
Springer
139views Database» more  DEXA 2006»
14 years 22 days ago
Efficient Processing of Multiple XML Twig Queries
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...
Huanzhang Liu, Tok Wang Ling, Tian Yu, Ji Wu
CIKM
2004
Springer
14 years 24 days ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 7 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 2 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
DBPL
2007
Springer
158views Database» more  DBPL 2007»
14 years 1 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens