Sciweavers

338 search results - page 19 / 68
» Numerical constraints on XML data
Sort
View
ECIR
2009
Springer
13 years 5 months ago
Refining Keyword Queries for XML Retrieval by Combining Content and Structure
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
Desislava Petkova, W. Bruce Croft, Yanlei Diao
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
WWW
2007
ACM
14 years 8 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin
LPAR
2010
Springer
13 years 5 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan
DASFAA
2003
IEEE
84views Database» more  DASFAA 2003»
14 years 21 days ago
Supporting Selection-Projection XQuery Processing Based on Encoding Paths
Providing an efficient way to support XML query processing has become a very important issue. A system called XQP (XQuery Processor) is proposed in this paper to meet the need. X...
Ya-Hui Chang, Cheng-Ta Lee