96 search results - page 5 / 20 » Path Constraints in Semistructured Databases |
179
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
WEBDB
2001
Springer
15 years 2 months ago
2001
Springer
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
FQAS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
101
click to vote
ADC
2008
Springer
15 years 4 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
ICDT
2003
ACM
15 years 2 months ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...