Sciweavers

58 search results - page 7 / 12
» Labeling and Querying Dynamic XML Trees
Sort
View
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
14 years 29 days ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho
ICDT
2003
ACM
126views Database» more  ICDT 2003»
14 years 21 days ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
SEBD
2003
159views Database» more  SEBD 2003»
13 years 8 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
VLDB
2008
ACM
136views Database» more  VLDB 2008»
14 years 7 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu