D-FOPA: A dynamic final object pruning algorithm to efficiently produce skyline points over data streams

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Emerging technologies that support sensor networks are making available large volumes of sensed data. Commonly, sensed data entries are characterized by several sensed attributes and can be related to static attributes; both sensed and static attributes can be represented using Vertically Partitioned Tables (VPTs). Skyline-based ranking techniques provide the basis to distinguish the entries that best meet a user condition, and allow for the pruning of the space of potential answers. We tackle the problem of efficiently computing the skyline over sensed and static data represented as Vertically Partitioned Tables (VPTs). We propose an algorithm named D-FOPA (Dynamic Final Object Pruning Algorithm), a rank-based approach able to dynamically adjust the skyline by processing changes on values of sensed attributes. We conducted an empirical study on datasets of synthetic sensed data, and the results suggest that D-FOPA is not only able to scale up to large datasets, but reduces average execution time and number of comparisons of state-of the-art approaches by up to one order of magnitude.

Cite

CITATION STYLE

APA

Alibrandi, S., Bravo, S., Goncalves, M., & Vidal, M. E. (2015). D-FOPA: A dynamic final object pruning algorithm to efficiently produce skyline points over data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9262, pp. 117–133). Springer Verlag. https://doi.org/10.1007/978-3-319-22852-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free