Conference item
Tractability beyond β-acyclicity for conjunctive queries with negation
- Abstract:
-
Numerous fundamental database and reasoning problems are known to be NP-hard in general but tractable on instances where the underlying hypergraph structure is β-acyclic. Despite the importance of many of these problems, there has been little success in generalizing these results beyond acyclicity. In this paper, we take on this challenge and propose nest-set width, a novel generalization of hypergraph β-acyclicity. We demonstrate that nest-set width has desirable properties and algorithmic s...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, 774.6KB)
-
- Publisher copy:
- 10.1145/3452021.3458308
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- Publisher:
- Association for Computing Machinery Publisher's website
- Pages:
- 355–369
- Host title:
- PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
- Publication date:
- 2021-06-20
- Acceptance date:
- 2021-04-14
- Event title:
- ACM SIGMOD/PODS 2021: International Conference on Management of Data
- Event location:
- Virtual event (Xi'an, Shaanxi, China)
- Event website:
- https://2021.sigmod.org/
- Event start date:
- 2021-06-20T00:00:00Z
- Event end date:
- 2021-06-25T00:00:00Z
- DOI:
- ISBN:
- 9781450383813
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
1172620
- Local pid:
- pubs:1172620
- Deposit date:
- 2021-04-20
Terms of use
- Copyright holder:
- Association for Computing Machinery
- Copyright date:
- 2021
- Rights statement:
- Copyright © 2021 ACM.
- Notes:
- This paper was presented at ACM SIGMOD/PODS 2021: International Conference on Management of Data , 20-25 June 2021, Virtual event (Xi'an, Shaanxi, China). This is the accepted manuscript version of the paper. The final version is available online from the Association for Computing Machinery at: https://doi.org/10.1145/3452021.3458308
If you are the owner of this record, you can report an update to it here: Report update to this record