Query shredding : Efficient relational evaluation of queries over nested multisets
- Submitting institution
-
Heriot-Watt University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 41275462
- Type
- E - Conference contribution
- DOI
-
10.1145/2588555.2612186
- Title of conference / published proceedings
- SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
- First page
- 1027
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- June
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 11
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Originality: First formal account of generating SQL queries from nested relational calculus queries returning nested multisets. Formal guarantees about number of generated queries avoid major performance problems suffered by prior systems. Significance: Implemented in the Links web programming language. Features prominently in an £1M EPSRC Grant on nested data (EP/T022124/1). Essential ingredient for a €2M ERC Consolidater Grant (682315) on language-integrated provenance. Rigour: Performance evaluation shows significant improvement compared to a prior implementation based on list semantics. Formal proofs. SIGMOD is the world-leading conference on databases. Acceptance rate (2014): 25%.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
