Article

Containment of conjunctive regular path queries with inverse

Authors:

Diego Calvanese,

Giuseppe De Giacomo,

Maurizio Lenzerini,

Moshe Y. VardiAuthors Info & Claims

KR'00: Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning

Pages 176 - 185

Published: 11 April 2000 Publication History

Abstract

No abstract available.

Cited By

View all

Zhang XÖzsu M(2019)Correlation constraint shortest path over large multi-relation graphsProceedings of the VLDB Endowment10.14778/3303753.330375612:5(488-501)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.14778/3303753.3303756
Abriola SBarceló PFigueira DFigueira S(2018)Bisimulations on data graphsJournal of Artificial Intelligence Research10.5555/3241691.324169461:1(171-213)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3241691.3241694
Freydenberger DKimelfeld BPeterfreund LVan den Bussche JArenas M(2018)Joining Extractions of Regular ExpressionsProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196967(137-149)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196967
Show More Cited By

Index Terms

Containment of conjunctive regular path queries with inverse

Index terms have been assigned to the content through auto-classification.

Recommendations

View-based query processing for regular path queries with inverse
PODS '00: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

View-based query processing is the problem of computing the answer to a query based on a set of materialized views, rather than on the raw data in the database. The problem comes in two different forms, called query rewriting and query answering, ...
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
Highlights
- Using containments of conjunctive queries (CQ) to express boolean queries.
- ...
Abstract
When a relational database is queried, the result is normally a relation. Some queries, however, only require a yes/no answer; such queries are often called boolean queries. It is customary in database theory to express boolean queries ...
Decidable containment of recursive queries
Database theory

One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query ...

Comments

Information & Contributors

Information

Published In

KR'00: Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning

April 2000

733 pages

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 11 April 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang XÖzsu M(2019)Correlation constraint shortest path over large multi-relation graphsProceedings of the VLDB Endowment10.14778/3303753.330375612:5(488-501)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.14778/3303753.3303756
Abriola SBarceló PFigueira DFigueira S(2018)Bisimulations on data graphsJournal of Artificial Intelligence Research10.5555/3241691.324169461:1(171-213)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3241691.3241694
Freydenberger DKimelfeld BPeterfreund LVan den Bussche JArenas M(2018)Joining Extractions of Regular ExpressionsProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196967(137-149)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196967
Libkin LReutter JSoto AVrgoč D(2018)TriALACM Transactions on Database Systems10.1145/315438543:1(1-46)Online publication date: 23-Mar-2018
https://dl.acm.org/doi/10.1145/3154385
Romero MBarceló PVardi MAceto LIngólfsdóttir A(2017)The homomorphism problem for regular graph patternsProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330041(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330041
Baier JDaroch DReutter JVrgoč DDolog PVojtas PBonchi FHelic D(2017)Evaluating Navigational RDF Queries over the WebProceedings of the 28th ACM Conference on Hypertext and Social Media10.1145/3078714.3078731(165-174)Online publication date: 4-Jul-2017
https://dl.acm.org/doi/10.1145/3078714.3078731
Barceló PMuñoz P(2017)Graph Logics with Rational RelationsACM Transactions on Computational Logic10.1145/307082218:2(1-41)Online publication date: 5-May-2017
https://dl.acm.org/doi/10.1145/3070822
Reutter JRomero MVardi M(2017)Regular Queries on Graph DatabasesTheory of Computing Systems10.1007/s00224-016-9676-261:1(31-83)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s00224-016-9676-2
Liptchinsky VSatzger BZabolotnyi RDustdar SSchwabe DAlmeida VGlaser HBaeza-Yates RMoon S(2013)Expressive languages for selecting groups from graph-structured dataProceedings of the 22nd international conference on World Wide Web10.1145/2488388.2488455(761-770)Online publication date: 13-May-2013
https://dl.acm.org/doi/10.1145/2488388.2488455
Hurtado CPoulovassilis AWood P(2009)Ranking Approximate Answers to Semantic Web QueriesProceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications10.1007/978-3-642-02121-3_22(263-277)Online publication date: 31-May-2009
https://dl.acm.org/doi/10.1007/978-3-642-02121-3_22

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

View-based query processing for regular path queries with inverse

A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries

Decidable containment of recursive queries

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations