Results 151 to 160 of about 391,863 (191)
Some of the next articles are maybe not open access.
Top-k Combinatorial Skyline Queries
2010The problem of top-k skyline computation has attracted considerable research attention in the past few years. Given a dataset, a top-k skyline returns k “most interesting” skyline tuples based on some kind of preference specified by the user. We extend the concept of top-k skyline to a so-called top-k combinatorial skyline query (k-CSQ). In contrast to
I-Fang Su, Yu-Chi Chung, Chiang Lee
openaire +1 more source
2011
Efficient retrieval of the most relevant (i.e. top-k) tuples is an important requirement in information management systems which access large amounts of data. In general answering a top-k query request means to retrieve the k objects which score best for an objective function. We propose some improvements to the best position algorithm (BPA-2) [2].
Claus Dabringer, Johann Eder
openaire +1 more source
Efficient retrieval of the most relevant (i.e. top-k) tuples is an important requirement in information management systems which access large amounts of data. In general answering a top-k query request means to retrieve the k objects which score best for an objective function. We propose some improvements to the best position algorithm (BPA-2) [2].
Claus Dabringer, Johann Eder
openaire +1 more source
Optimizing Distributed Top-k Queries
2008Top-kquery processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper introduces novel optimization methods for top-kaggregation queries in such distributed environments ...
Neumann, T. +5 more
openaire +2 more sources
Top-k Neighborhood Dominating Query
2013In many real-life applications, spatial objects are associated with multiple non-spatial attributes. For example, a hotel may have price and rating in addition to its geographic location. In traditional spatial databases, spatial objects are often ranked solely based on their distance to a given query location, e.g., in a nearest neighbor search.
Xike Xie +3 more
openaire +2 more sources
Probabilistic Reverse Top-k Queries
2014Ranking-aware query is one of the most fundamental queries in the database management field. The ranking query that returns top-k elements with maximal ranking scores according to a ranking function has been widely studied for decades. Recently, some researchers also focus on finding all customers who treat the given query object one of their top-k ...
Cheqing Jin +4 more
openaire +1 more source
Scalable top-k spatio-temporal term querying
2014 IEEE 30th International Conference on Data Engineering, 2014With the rapidly increasing deployment of Internet-connected, location-aware mobile devices, very large and increasing amounts of geo-tagged and timestamped user-generated content, such as microblog posts, are being generated. We present indexing, update, and query processing techniques that are capable of providing the top-k terms seen in posts in a ...
Skovsgaard, Anders +2 more
openaire +1 more source
Answering Top-k Exemplar Trajectory Queries
2017 IEEE 33rd International Conference on Data Engineering (ICDE), 2017We study a new type of spatial-textual trajectory search: the Exemplar Trajectory Query (ETQ), which specifies one or more places to visit, and descriptions of activities at each place. Our goal is to efficiently find the top-k trajectories by computing spatial and textual similarity at each point.
Sheng Wang +5 more
openaire +1 more source
Interactive Top-k Spatial Keyword queries
2015 IEEE 31st International Conference on Data Engineering, 2015Conventional top-k spatial keyword queries require users to explicitly specify their preferences between spatial proximity and keyword relevance. In this work we investigate how to eliminate this requirement by enhancing the conventional queries with interaction, resulting in Interactive Top-k Spatial Keyword (ITkSK) query.
Kai Zheng +6 more
openaire +1 more source
Top-k Answers to Fuzzy XPath Queries
2009Data heterogeneity in XML repositories can be tackled by giving users the possibility to obtain approximate answers to their queries. In this setting, several approaches for XPath queries have been defined in the literature. In particular, fuzzy XPath queries have been recently introduced as a formalism to provide users with a clear understanding of ...
FAZZINGA B +2 more
openaire +3 more sources