Köppl, Dominik2015-11-262015-11-262014-08-11http://hdl.handle.net/2003/3436010.17877/DE290R-16434Given a sequential data input, we tackle parallel dynamic skyline computation of the read data by means of a spatial tree structure for indexing fine-grained feature vectors. For this purpose, we modified the Skyline Breaker algorithm that solves skyline computation with multiple local split decision trees concurrently. With this approach, we propose an algorithm for dynamic skyline computation that inherits the robustness against the dimension curse and different data distributions.enLocal Proceedings of the Workshop on Massive Data Algorithmics (MASSIVE), Wrocław, 2014Computation of Pareto FrontDynamic Skyline ComputationParallel AlgorithmsGeometric Algorithms004conference contribution