96 search results - page 4 / 20 » Path Constraints in Semistructured Databases |
103
click to vote
DEXAW
2006
IEEE
15 years 3 months ago
2006
IEEE
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
FUIN
2002
14 years 9 months ago
2002
Abstract. In the paper we deal with the problem of modeling and querying information in schemaless databases of partially labeled objects (PLO-DB). Partially labeled objects are us...
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may be obtained by applying database concepts and tech...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
171
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
The nature of semistructured data in web collections is evolving. Increasingly, XML web documents (or documents exchanged via web services) are valid with regard to a schema, yet ...