CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Processing top-k dominating queries in metric spaces
Authors
E. Tiakas Valkanas, G. Papadopoulos, A.N. Manolopoulos, Y. Gunopulos, D.
Publication date
1 January 2016
Publisher
Abstract
Top-k dominating queries combine the natural idea of selecting the k best items with a comprehensive "goodness" criterion based on dominance. A point p1 dominates p2 if p1 is as good as p2 in all attributes and is strictly better in at least one. Existing works address the problem in settings where data objects are multidimensional points. However, there are domains where we only have access to the distance between two objects. In cases like these, attributes reflect distances from a set of input objects and are dynamically generated as the input objects change. Consequently, prior works from the literature cannot be applied, despite the fact that the dominance relation is still meaningful and valid. For this reason, in this work, we present the first study for processing top-k dominating queries over distance-based dynamic attribute vectors, defined over a metric space.We propose four progressive algorithms that utilize the properties of the underlying metric space to efficiently solve the problem and present an extensive, comparative evaluation on both synthetic and real-world datasets. © 2016 ACM
Similar works
Full text
Available Versions
Pergamos : Unified Institutional Repository / Digital Library Platform of the National and Kapodistrian University of Athens
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:lib.uoa.gr:uoadl:3071437
Last time updated on 10/02/2023