Xie, M. and Lakshmanan, L.V.S. and Wood, Peter T. (2011) Efficient rank join with aggregation constraints. Proceedings of the VLDB Endowment 4 (11), pp. 1201-1212. ISSN 2150-8097.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text (Refereed)
ptw-vldb.pdf - Published Version of Record Restricted to Repository staff only Download (411kB) |
Abstract
We show aggregation constraints that naturally arise in several applications can enrich the semantics of rank join queries, by allowing users to impose their application-specific preferences in a declarative way. By analyzing the properties of aggregation constraints, we develop ecient deterministic and probabilistic algorithms which can push the aggregation constraints inside the rank join framework. Through extensive experiments on various datasets, we show that in many cases our proposed algorithms can significantly outperform the naive approach of applying the state-of-theart rank join algorithm followed by post-filtering to discard results violating the constraints.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Peter Wood |
| Date Deposited: | 20 Dec 2012 11:11 |
| Last Modified: | 23 Feb 2025 17:02 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/5800 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
