The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Group-by skyline query processing in relational engines
Abstract
The skyline operator was first proposed in 2001 for retrieving interesting tuples from a dataset. Since then, 100+ skyline-related papers have been published; however, we discovered that one of the most intuitive and practical type of skyline queries, namely, group-by skyline queries remains unaddressed. Group-by skyline queries find the skyline for each group of tuples. In this paper, we present a comprehensive study on processing group-by skyline queries in the context of relational engines. Specifically, we examine the composition of a query plan for a group-by skyline query and develop the missing cost model for the BBS algorithm. Experimental results show that our techniques are able to devise the best query plans for a variety of group-by skyline queries. Our focus is on algorithms that can be directly implemented in today's commercial database systems without the addition of new access methods (which would require addressing the associated challenges of maintenance with updates, concurrency control, etc.).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Borzsony, S., Kossmann, D., & Stocker, K. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2001.914855 · Cited by 2,266
Korth, H. F., & Silberschatz, A. (1980) · Cited by 1,784
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
An optimal and progressive algorithm for skyline queries
Papadias, D., Tao, Y., Fu, G., et al. (2003) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/872757.872814 · Cited by 815
Approaching the skyline in Z order
Lee, K. C. K., Zheng, B., Li, H., & Lee, W.-C. (2007) · Singapore Management University Institutional Knowledge (InK) (Singapore Management University) · Cited by 192
Cited by
SMOTE for high-dimensional class-imbalanced data
Blagus, R., & Lusa, L. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-106 · Cited by 1,106
Leaders in Social Networks, the Delicious Case
Lü, L., Zhang, Y.-C., Yeung, C. H., & Zhou, T. (2011) · PLoS ONE · doi:10.1371/journal.pone.0021202 · Cited by 871
Predicting disease risks from highly imbalanced data using random forest
Khalilia, M., Chakraborty, S., & Popescu, M. (2011) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-11-51 · Cited by 713
A Comprehensive Survey of Neighborhood-Based Recommendation Methods
Ning, X., Desrosiers, C., & Karypis, G. (2015) · Recommender Systems Handbook · doi:10.1007/978-1-4899-7637-6_2 · Cited by 641
Survey on mining subjective data on the web
Tsytsarau, M., & Palpanas, T. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0238-6 · Cited by 443
Metadata
- Authors
- Luk, M.-H., Yiu, M. L., & Lo, E.
- Venue
- Proceedings of the 18th ACM conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2009-11-02
- Pages
- 1433-1436
- OpenAlex
- W3142746689
- Cited by
- 279
- References
- 5
- FWCI
- 51.63
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Group-by skyline query processing in relational engines. https://app.cochat.ai/papers/10.1145/1645953.1646138
- The paper
- Luk, M.-H., Yiu, M. L., & Lo, E. (2009). Group-by skyline query processing in relational engines. Proceedings of the 18th ACM conference on Information and knowledge management. https://doi.org/10.1145/1645953.1646138
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.