Sciweavers

8220 search results - page 102 / 1644
» Querying XML Data
Sort
View
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
14 years 1 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
CIKM
2004
Springer
14 years 1 months 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
DASFAA
2010
IEEE
252views Database» more  DASFAA 2010»
14 years 2 months ago
Effectively Inferring the Search-for Node Type in XML Keyword Search
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword qu...
Jiang Li, Junhu Wang
EDBT
2011
ACM
205views Database» more  EDBT 2011»
13 years 1 months ago
A probabilistic XML merging tool
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
Talel Abdessalem, M. Lamine Ba, Pierre Senellart
INFSOF
2006
117views more  INFSOF 2006»
13 years 9 months ago
A high concurrency XPath-based locking protocol for XML databases
Providing efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocols for XML database systems were proposed in the past...
Kuen-Fang Jack Jea, Shih-Ying Chen