Results 141 to 150 of about 391,863 (191)
Some of the next articles are maybe not open access.
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing.
Akrivi Vlachou +3 more
openaire +1 more source
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing.
Akrivi Vlachou +3 more
openaire +1 more source
2020
This chapter focuses on continuously finding the most relevant (shortly, top-k) answer of a query that joins streaming and distributed data. Remaining reactive can be challenging, when accessing the distributed data has high latency and is rate limited.
Shima Zahmatkesh, Emanuele Della Valle
openaire +1 more source
This chapter focuses on continuously finding the most relevant (shortly, top-k) answer of a query that joins streaming and distributed data. Remaining reactive can be challenging, when accessing the distributed data has high latency and is rate limited.
Shima Zahmatkesh, Emanuele Della Valle
openaire +1 more source
Algebraic query optimization for distributed top-k queries
Informatik - Forschung und Entwicklung, 2007Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient algebraic optimization of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query are distributed across a
Neumann, T., Michel, S.
openaire +3 more sources
2012
Recently there has been an increased interest in database management systems to incorporate and support more flexible query operators, such as top-k, that produce results of specified cardinality, thus avoiding huge and overwhelming result sets. Top-k queries retrieve the objects that best match the user requirements by employing user-specified scoring
Akrivi Vlachou +3 more
openaire +1 more source
Recently there has been an increased interest in database management systems to incorporate and support more flexible query operators, such as top-k, that produce results of specified cardinality, thus avoiding huge and overwhelming result sets. Top-k queries retrieve the objects that best match the user requirements by employing user-specified scoring
Akrivi Vlachou +3 more
openaire +1 more source
Information Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Dong, Zou, Lei, Zhao, Dongyan
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Dong, Zou, Lei, Zhao, Dongyan
openaire +2 more sources
Processing top-k queries from samples
Computer Networks, 2006Top-k queries are desired aggregation operations on datasets. Examples of queries on network data include finding the top 100 source Autonomous Systems (AS), top 100 ports, or top domain names over IP packets or over IP flow records. Since the complete dataset is often not available or not feasible to examine, we are interested in processing top-k ...
Edith Cohen, Nadav Grossaug, Haim Kaplan
openaire +1 more source
Colored top-K range-aggregate queries
Information Processing Letters, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanyal, Biswajit +2 more
openaire +2 more sources
Continuous Top-k Dominating Queries
IEEE Transactions on Knowledge and Data Engineering, 2012Top-k dominating queries use an intuitive scoring function which ranks multidimensional points with respect to their dominance power, i.e., the number of points that a point dominates. The k points with the best (e.g., highest) scores are returned to the user. Both top-k and skyline queries have been studied in a streaming environment, where changes to
M. Kontaki +2 more
openaire +1 more source
Privacy-Preserving Top-k Queries
21st International Conference on Data Engineering (ICDE'05), 2005The primary contribution of this paper is a secure method for doing top-k selection from vertically partitioned data. This has particular relevance to privacy-sensitive searches, and meshes well with privacy policies such as k-anonymity. We have demonstrated how secure primitives from the literature can be composed with efficient query processing ...
J. Vaidya, C. Clifton
openaire +1 more source
2017 18th IEEE International Conference on Mobile Data Management (MDM), 2017
Given a current point, a final destination, and visiting data point categories on a trip, a sequenced route query finds the shortest route which meets the query condition. Several algorithms have been proposed targeting to this query. When this query is used in real applications, the popularity of the visiting points (for example, restaurant, shopping ...
Yutaka Ohsawa, Htoo Htoo
openaire +1 more source
Given a current point, a final destination, and visiting data point categories on a trip, a sequenced route query finds the shortest route which meets the query condition. Several algorithms have been proposed targeting to this query. When this query is used in real applications, the popularity of the visiting points (for example, restaurant, shopping ...
Yutaka Ohsawa, Htoo Htoo
openaire +1 more source