7 search results - page 1 / 2 » Query Answering and Containment for Regular Path Queries und... |
FOIKS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
PODS
2003
ACM
14 years 4 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
ICDT
2007
ACM
13 years 10 months ago
2007
ACM
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for “scaling” up or down the i...
FUIN
2008
13 years 4 months ago
2008
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
PODS
2009
ACM
14 years 5 months ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...