Filters








62,996 Hits in 5.4 sec

Distributed top-k aggregation queries at large

Thomas Neumann, Matthias Bender, Sebastian Michel, Ralf Schenkel, Peter Triantafillou, Gerhard Weikum
2009 Distributed and parallel databases  
This paper introduces novel optimization methods for top-k aggregation queries in such distributed environments.  ...  Top-k query processing is a fundamental building block for efficient ranking in a large number of applications.  ...  Fig. 1 (b)) avoids overly broad top-k aggregation queries that involve too many nodes at the same time and could lead to (incoming) bandwidth bottlenecks at the root of the aggregation.  ... 
doi:10.1007/s10619-009-7041-z fatcat:qid6zibirvfm5c4i3xfkz2a4z4

Skyline-based Peer-to-Peer Top-k Query Processing

Akrivi Vlachou, Christos Doulkeridis, Kjetil Norvag, Michalis Vazirgiannis
2008 2008 IEEE 24th International Conference on Data Engineering  
In this paper, we present a novel framework for top-k query processing in largescale P2P networks, where the dataset is horizontally distributed to peers.  ...  Therefore a challenging problem is to support best-match query processing in highly distributed environments.  ...  Then, super-peers aggregate the K-skyband sets from their peers, and maintain this aggregated data to answer any incoming top-k query.  ... 
doi:10.1109/icde.2008.4497576 dblp:conf/icde/VlachouDNV08 fatcat:ry4hbh7h2fgn5e2m4z3xjey47u

Algebraic query optimization for distributed top-k queries

Thomas Neumann, Sebastian Michel
2007 Informatik - Forschung und Entwicklung  
Distributed 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  ...  Future work includes the integration of other distributed top-k algorithms than [CW04] and multi-query optimization across different distributed top-k queries.  ... 
doi:10.1007/s00450-007-0024-2 fatcat:vzxrrrnlj5g6va7vrwecglwt44

KTV-Tree: Interactive Top-K Aggregation on Dynamic Large Dataset in the Cloud

Yuzhe Tang, Ling Liu, Junichi Tatemura, Hakan Hacigumus
2015 2015 IEEE 35th International Conference on Distributed Computing Systems Workshops  
This paper studies the problem of supporting interactive top-k aggregation query over dynamic data in the cloud.  ...  We propose KTV-TREE, a top-K Threshold-based materialized View TREE, which achieves the fast processing of top-k aggregation queries by efficiently materialized views.  ...  Towards the goal, this work particularly addresses one important type of the analytical queries, namely the top-k aggregations with range predicate (or top-k aggregation for short).  ... 
doi:10.1109/icdcsw.2015.32 dblp:conf/icdcsw/TangLTH15 fatcat:4selowu3grezle6a3salcedogy

Optimization of Accurate Top-k Query in Sensor Networks with Cached Data

Qunhua Pan, Minglu Li, Min-You Wu, Wei Shu
2007 2007 IEEE Wireless Communications and Networking Conference  
We propose a history-based approach to optimizing query processing. We apply the approach to the top-k query problem and design new algorithms.  ...  This approach can be generalized for other query problems.  ...  to the top-k query distributed algorithms.  ... 
doi:10.1109/wcnc.2007.773 dblp:conf/wcnc/PanLWS07 fatcat:fmjg63szerf4rabdxfpsceeipq

Guest editorial: special issue on ranking in databases

Ihab Ilyas
2009 Distributed and parallel databases  
To address the limitations of the Boolean retrieval model, top-k queries and ranking query results are gaining increasing importance.  ...  In particular, a large number of emerging applications require exploratory querying on general-purpose or domain-specific databases; examples include users wishing to search bibliographic databases or  ...  Rank aggregation in distributed environments The paper titled "Distributed Top-k Aggregation Queries at Large" focuses on optimizing top-k query processing algorithms in distributed environments.  ... 
doi:10.1007/s10619-009-7052-9 fatcat:gvbfloijajfqxjzsmcstvmcphi

Optimizing Multi-Feature Queries for Image Databases

Ulrich Güntzer, Wolf-Tilo Balke, Werner Kießling
2000 Very Large Data Bases Conference  
Such multi-feature queries return a ranked result set instead of exact matches. Besides, the user wants to see only the k top-ranked objects.  ...  For score aggregation virtually any combining function can be used, including weighted queries.  ...  The HERON-project is funded by the German Research Foundation DFG within the strategic research initiative "Distributed Processing and Exchange of Digital Documents".  ... 
dblp:conf/vldb/GuntzerBK00 fatcat:4tz3opqfwra6ng5rp2dyzityk4

An Effective K-Nearest Neighbor Track Retrieval Algorithm

Chen Wen
2016 International Journal of Database Theory and Application  
This paper studies the issue of k-nearest neighbor track retrieval facing moving object, and converts this issue into aggregate Top-k query issue of information retrieval field.  ...  Performance of this algorithm is verified through a large number of experiments.  ...  the issue of aggregate Top-k query.  ... 
doi:10.14257/ijdta.2016.9.3.16 fatcat:umph5wybvncuxoal6rapp7bg34

SeeDB

Manasi Vartak, Sajjadur Rahman, Samuel Madden, Aditya Parameswaran, Neoklis Polyzotis
2015 Proceedings of the VLDB Endowment  
Our optimizations lead to multiple orders of magnitude speedup on relational row and column stores and provide recommendations at interactive time scales.  ...  We implement SEEDB as a middleware layer that can run on top of any DBMS. Our experiments show that our framework can identify interesting visualizations with high accuracy.  ...  For k=1 and 2, the accuracy is 75% for both pruning strategies (due to largek values).  ... 
doi:10.14778/2831360.2831371 fatcat:6uwm2xelenbqpe2ymkqyocngz4

Aggregate estimations over location based services

Weimo Liu, Md Farhadur Rahman, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das
2015 Proceedings of the VLDB Endowment  
The public query interfaces of these services may be abstractly modeled as a kNN interface over a database of two dimensional points on a plane: given an arbitrary query point, the system returns the k  ...  In this paper we consider the problem of obtaining approximate estimates of SUM and COUNT aggregates by only querying such databases via their restrictive public interfaces.  ...  is better depends on the exact aggregate being estimated -specifically, whether the distribution of the attribute being aggregated is better "aligned" with the size distribution of top-1 or top-h Voronoi  ... 
doi:10.14778/2824032.2824034 fatcat:gh44cbvw35f2hkii5oh24donwe

A demonstration of AQWA

Ahmed M. Aly, Ahmed S. Abdelhamid, Ahmed R. Mahmood, Walid G. Aref, Mohamed S. Hassan, Hazem Elmeleegy, Mourad Ouzzani
2015 Proceedings of the VLDB Endowment  
A key feature of AQWA is that it does not assume prior knowledge of the query-workload or data distribution.  ...  In both prototypes, we process spatial range and k-nearest-neighbor (kNN, for short) queries over largescale spatial datasets, and we exploit the performance of AQWA under different query-workloads.  ...  At this moment, the value at each cell, say G[i, j], corresponds to the number of points in the rectangle bounded by G[0, 0] (top-left) and G[i, j] (bottom-right). at t0. (b) Partitioning at t1.  ... 
doi:10.14778/2824032.2824113 fatcat:qndtjssq3bfyvgupzumr223o6m

Efficient Top-k Query Processing in P2P Network [chapter]

Yingjie He, Yanfeng Shu, Shan Wang, Xiaoyong Du
2004 Lecture Notes in Computer Science  
Top-k query is widely used in the search engine and gains great success, which perform the cooperative query by aggregating the database objects' degree of match for each different query predicate and  ...  However, top-k query processing in p2p systems is very challenging because the potentially large number of peers may contribute to the query results, which may induce a huge amount of network traffic and  ...  At the end of the second round-trip (step 3), the querying peer has seen objects in the true top-k set.  ... 
doi:10.1007/978-3-540-30075-5_37 fatcat:i7xk75cod5hmbkzuuzmdctbwla

Just-in-Time Analytics on Large File Systems

H. Howie Huang, Nan Zhang, Wei Wang, Gautam Das, Alexander S. Szalay
2012 IEEE transactions on computers  
Two particularly important tasks are the processing of aggregate and top-k queries which, unfortunately, cannot be quickly answered by hierarchical file systems such as ext3 and NTFS.  ...  We develop Glance, a just-in-time sampling-based system which, after consuming a small number of disk accesses, is capable of producing extremely accurate answers for a broad class of aggregate and top-k  ...  that, to approximately answer a top-k query, one shall return a list of k items that share a large percentage of common ones with the precise top-k list.  ... 
doi:10.1109/tc.2011.186 fatcat:6xs2ybmb3bfpfibu3wrc5evvne

Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead

Kamalas UDOMLAMLERT, Takahiro HARA, Shojiro NISHIO
2016 IEICE transactions on information and systems  
In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned.  ...  Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions.  ...  BS simply aggregates Kskyband from every local node, so any top-k queries at BS can be answered intermediately by the aggregated data objects.  ... 
doi:10.1587/transinf.2015edp7377 fatcat:duarhticyrbilbvbbx3a2wsm6u

Aggregate Estimations over Location Based Services [article]

Weimo Liu, Md Farhadur Rahman, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das
2015 arXiv   pre-print
The public query interfaces of these services may be abstractly modeled as a kNN interface over a database of two dimensional points on a plane: given an arbitrary query point, the system returns the k  ...  In this paper we consider the problem of obtaining approximate estimates of SUM and COUNT aggregates by only querying such databases via their restrictive public interfaces.  ...  Second, the optimal sampling distribution depends on both the tuple distribution and the aggregate query itself.  ... 
arXiv:1505.02441v2 fatcat:4ehq7cfb5jdsbdvhzz23bdtgyy
« Previous Showing results 1 — 15 out of 62,996 results