S. Ghandeharizadeh, Y. Alabdulkarim, and H. Nguyen. RangeQC: A Framework for Caching Range Predicate Query Results. Technical Report 2018-03, USC Database Laboratory, 2018, http://dblab.usc.edu/Users/papers/RangeQC.pdf.

Digital Library

Google Scholar

[4]

P. O'Neil, E. Cheng, D. Gawlick, and E. O'Neil. The Log-structured Merge-tree (LSM-tree). Acta Inf., 33(4):351--385, June 1996.

Digital Library

Google Scholar

Cited By

View all

Alabdulkarim YAlmaymoni MGhandeharizadeh SHuang HNguyen H(2018)Testing Database Applications with PolygraphProceedings of the 20th International Conference on Information Integration and Web-based Applications & Services10.1145/3282373.3282378(200-206)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3282373.3282378
Ghandeharizadeh SAlabdulkarim YNguyen H(2018)RangeQCProceedings of the ACM Symposium on Cloud Computing10.1145/3267809.3275456(514-514)Online publication date: 11-Oct-2018
https://dl.acm.org/doi/10.1145/3267809.3275456

Recommendations

Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database Theory

The problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Scalable and efficient processing of top-k multiple-type integrated queries
Abstract
In this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Query containment under bag and bag-set semantics

Conjunctive queries (CQs) are at the core of query languages encountered in many logic-based research fields such as AI, or database systems. The majority of existing work assumes set semantics but often in real applications the manipulation of ...

Comments

Information & Contributors

Information

Published In

SoCC '18: Proceedings of the ACM Symposium on Cloud Computing

October 2018

546 pages

ISBN:9781450360111

DOI:10.1145/3267809

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 October 2018

Check for updates

Qualifiers

Poster
Research
Refereed limited

Conference

SoCC '18

Sponsor:

SoCC '18: ACM Symposium on Cloud Computing

October 11 - 13, 2018

CA, Carlsbad, USA

Acceptance Rates

Overall Acceptance Rate 169 of 722 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
96
Total Downloads

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

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alabdulkarim YAlmaymoni MGhandeharizadeh SHuang HNguyen H(2018)Testing Database Applications with PolygraphProceedings of the 20th International Conference on Information Integration and Web-based Applications & Services10.1145/3282373.3282378(200-206)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3282373.3282378
Ghandeharizadeh SAlabdulkarim YNguyen H(2018)RangeQCProceedings of the ACM Symposium on Cloud Computing10.1145/3267809.3275456(514-514)Online publication date: 11-Oct-2018
https://dl.acm.org/doi/10.1145/3267809.3275456

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.

Cited By

Recommendations

Equivalence and minimization of conjunctive queries under combined semantics

Scalable and efficient processing of top-k multiple-type integrated queries

Query containment under bag and bag-set semantics

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

Equivalence and minimization of conjunctive queries under combined semantics

Scalable and efficient processing of top-k multiple-type integrated queries

Query containment under bag and bag-set semantics

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations