Sciweavers

458 search results - page 15 / 92
» Evaluation of partial path queries on xml data
Sort
View
EEE
2004
IEEE
15 years 3 months ago
An Encoding Scheme for Indexing XML Data
E-Services are becoming as promising technology for the effective automation of application integration across Web. They build upon XML, as data format for exchanging messages bet...
Wansong Zhang, Daxin Liu, Jian Li
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
15 years 11 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
15 years 3 months ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz
230
Voted
ICDE
2009
IEEE
153views Database» more  ICDE 2009»
16 years 1 months ago
XBLEND: Visual XML Query Formulation Meets Query Processing
Due to the complexity of XML query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of XML to wider c...
Zhou Yong, Sourav S. Bhowmick, Erwin Leonardi, Kla...
98
Voted
ADBIS
2004
Springer
125views Database» more  ADBIS 2004»
15 years 5 months ago
Using XSLT Stylesheets to Transform XPath Queries
Abstract. Often, XML documents stored in an XML database must be transformed by an XSL processor into a client-specific format before queries are submitted. In applications where X...
Sven Groppe, Stefan Böttcher, Reiko Heckel, G...