Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Distributed evaluation of generalized path queries
Proceedings of the 2005 ACM symposium on Applied computing
View-based query processing: on the relationship between rewriting, answering and losslessness
ICDT'05 Proceedings of the 10th international conference on Database Theory
Enhanced regular path queries on semistructured databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Towards practically feasible answering of regular path queries in lav data integration
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Annotated XML: queries and provenance
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Finding Top-k Approximate Answers to Path Queries
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 0.00 |
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 intrinsic importance of matching a symbol against a (semistructured) database edge label. Annotated regular path queries are expressed syntactically as annotated regular expressions. We interpret these expressions in a uniform semiring framework, which allows different semantics specializations for the same syntactic annotations. For our preference queries, we study three important aspects: (1) (progressive) query answering (2) (certain) query answering in LAV data-integration systems, and (3) query containment and equivalence. In all of these, we obtain important positive results, which encourage the use of our preference framework for enhanced querying of semistructured databases.