5,121 Hits in 3.8 sec

Reverse top-k queries

Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Norvag
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Furthermore, we introduce an indexing structure based on materialized reverse top-k views in order to speed up the computation of reverse top-k queries.  ...  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.  ...  Given a RTOP-Grid index, we define the average number of top-k query evaluations that are necessary for processing a reverse top-k query as a quality measure of RTOP-Grid, which can be expressed as the  ... 
doi:10.1109/icde.2010.5447890 dblp:conf/icde/VlachouDKN10 fatcat:6fk6wpcdkzbkzcarpnujey6ehu

Processing a large number of continuous preference top-kqueries

Albert Yu, Pankaj K. Agarwal, Jun Yang
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
We present a dynamic index that supports the reverse top-k query, which is of independent interest.  ...  Combining this index with another one for top-k queries, we develop a scalable solution for processing many continuous top-k queries that exploits the clusteredness in user preferences.  ...  For static reverse top-k queries, we have implemented our approach based on halfspace range queries (Section 3.1) using a quad-tree as the underlying index for cutoff points; 7 we call this algorithm  ... 
doi:10.1145/2213836.2213882 dblp:conf/sigmod/YuAY12 fatcat:msaf2avpird67hoylsolhrozui

Monochromatic and Bichromatic Reverse Top-k Queries

Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Norvag
2011 IEEE Transactions on Knowledge and Data Engineering  
Then, we study in detail the case of bichromatic reverse top-k query, and we propose two techniques for query processing, namely an efficient thresholdbased algorithm and an algorithm based on materialized  ...  Reverse top-k queries are essential for manufacturers to assess the impact of their products in the market based on the competition.  ...  Algorithm 3 can be adjusted to process reverse top-k queries over a grid constructed for arbitrary k ≤ K max . First, the cell C i that encloses q is determined.  ... 
doi:10.1109/tkde.2011.50 fatcat:uqnxxsr3hfdqljo5xv6cesjkve

Top-$k$ Preferences in High Dimensions

Albert Yu, Pankaj K. Agarwal, Jun Yang
2016 IEEE Transactions on Knowledge and Data Engineering  
Filter false positives and duplicates Reverse top−k query Subspace Top−k index Reverse top−k index Subspace Top−k index Reverse top−k index Subspace Top−k index Reverse top−k index  ...  RTOP-Grid uses a grid data structure for pruning. For each cell, a reverse top-k query is run for the lower-left and upper-right corners, and the result lists are stored in the cell.  ... 
doi:10.1109/tkde.2015.2451630 fatcat:lazczohbynhl3l4pn7efrh5eey

Efficient Top K Temporal Spatial Keyword Search [article]

Chengyuan Zhang, Lei Zhu, Weiren Yu, Jun Long, Fang Huang, Hongbo Zhao
2018 arXiv   pre-print
Base on SSG-tree an efficient algorithm is developed to support top-k temporal spatial keyword query.  ...  A novel index structure, namely SSG-tree, to efficiently insert/delete spatio-temporal web objects with high rates.  ...  A minimum heap H is employed to keep the Grid-Tree's nodes where the key of a node is its minimal spatial-temporal ranking score. For the input query, we calculate its frequency signature in Line 3.  ... 
arXiv:1805.02009v1 fatcat:r3wuweovuneiplfu7w7su7qi2a

The SPADES Framework for Scalable Management of Spatio-textual Data

Akrivi Vlachou, Christos Doulkeridis, Nikolaos Koutroumanis, Dimitrios Poulopoulos, Kjetil Nørvåg
2020 Panhellenic Conference on Informatics  
This is coupled with a processing layer that encompasses algorithms both for centralized and parallel processing.  ...  This paper presents the research activities in the context of the SPADES project for scalable indexing and processing of big spatial and spatio-textual data.  ...  ACKNOWLEDGMENTS This project has received funding from the Hellenic Foundation for Research and Innovation (HFRI) and the General Secretariat for Research and Technology (GSRT), under grant agreement No  ... 
doi:10.1145/3437120.3437293 dblp:conf/pci/VlachouDKPN20 fatcat:hngdbsr2zfgu3mjrg35lko63ju

Cumulative subject index volumes 68–71

1986 Information and Control  
Aggregation problems, formulation of several versions, analysis from recursion theoretic point of view, 70, 69 Algorithms for circular retrieval and k-nearest neighbor search problems, description and  ...  analysis, 68, 105 for computing properties and functions of n-node forest stored in processor mesh, 69, 168 deterministic, applications to optimal parallel list ranking, 70, 32 network resource allocation  ...  , 69, 1 game tree, solution on interconnected processor array, 69, 168 list ranking, applications of deterministic coin tossing, 70, 32 search, circular retrieval and k-nearest neighbor, algorithm  ... 
doi:10.1016/s0019-9958(86)80014-6 fatcat:hkligygazvcyvdgrhtvhrefpj4

Know your customer: computing k-most promising products for targeted marketing

Md. Saiful Islam, Chengfei Liu
2016 The VLDB journal  
We model k−MPP query and propose an algorithmic framework for processing such query and its variants.  ...  Our framework utilizes grid based data partitioning scheme and parallel computing techniques to realize k−MPP query.  ...  it is top-ranked.  ... 
doi:10.1007/s00778-016-0428-3 fatcat:vbnagp5oozaydfoumrjh3fkc74

Efficient query processing in geographic web search engines

Yen-Yu Chen, Torsten Suel, Alexander Markowetz
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06  
We propose several algorithms for efficient query processing in geographic search engines, integrate them into an existing web search query processor, and evaluate them on large sets of real data and query  ...  Query processing is a major bottleneck in standard web search engines, and the main reason for the thousands of machines used by the major engines.  ...  Acknowledgements We thank Xiaohui Long for access to his high-performance web search query execution software and for help in integrating the new spatial features.  ... 
doi:10.1145/1142473.1142505 dblp:conf/sigmod/ChenSM06 fatcat:nnl4xqiulrft5kqi3dbitxmf3y

TBSearch: Trust based Search in Unstructured Peer-to-peer Networks

Hoda Mashayekhi, Jafar Habibi, Habib Rostami
2008 2008 Fourth International Conference on Semantics, Knowledge and Grid  
TBSearch maintains limited size routing indexes combining search and trust data, to guide queries to most reputable nodes.  ...  We introduce a low overhead method of estimating peers' reputation scores, by aggregating partial reputations obtained from reverse query path.  ...  One of the most important parts of TBSearch algorithm is routing queries with the aid of TBSearch indexes.  ... 
doi:10.1109/skg.2008.99 dblp:conf/skg/MashayekhiHR08 fatcat:ehwc6rbvu5e2bj2624z4s2krou

Reverse k-ranks query

Zhao Zhang, Cheqing Jin, Qiangqiang Kang
2014 Proceedings of the VLDB Endowment  
Unfortunately, existing approaches for reverse top-k query cannot be used to handle R-kRanks conveniently due to infeasibility of getting enough elements for the query result.  ...  Inspired by this observation, we propose a new kind of query (R-kRanks) which finds for a given product, the topk customers whose rank for the product is highest among all customers, to ensure 100% coverage  ...  Representative work for bichromatic reverse top-k query includes threshold-based algorithm (RTA) [21] , grid-based algorithm (GRTA) [21] , and branch-and-bound algorithm (BBR) [25] .  ... 
doi:10.14778/2732951.2732952 fatcat:dbwfecsvkrddfn6zqruuid5aue


Siqiang Luo, Ben Kao, Guoliang Li, Jiafeng Hu, Reynold Cheng, Yudian Zheng
2018 Proceedings of the VLDB Endowment  
We propose TOAIN, which is a very flexible algorithm that can be easily trained to adapt to a given environment for maximizing query throughput.  ...  We show that query time is only one of the many parameters that impact throughput. Others include update time and query/update arrival rates.  ...  Readers are referred to [15] for the details of the CH algorithm and [1] for our shortcut creation algorithm. The SCOB Index The CH algorithm is designed to answer shortest-distance queries.  ... 
doi:10.1145/3187009.3177736 fatcat:opjbgy3zdzcntb5yayzxjoy2vy

Mining Precise Top-K Dominating Itemset from Data Streams

G. Sandhya
2013 IOSR Journal of Computer Engineering  
Top-K dominating query is a preference based query which determines the dominating itemset from the data stream. This query combines the notion of ranking function with the concept of dominance.  ...  This is adequate for static datasets, where updates are rare. As many modern applications adopt dynamic datasets, they need continuous query processing algorithms to revive the query result.  ...  A Grid based indexing scheme [9] maintains simplicity during the presentation of the algorithm.  ... 
doi:10.9790/0661-0911317 fatcat:lmlonltsczff3fihmbwhhbcsg4

Cooperative and decentralized workflow scheduling in global grids

Mustafizur Rahman, Rajiv Ranjan, Rajkumar Buyya
2010 Future generations computer systems  
To overcome these problems, this paper proposes a novel approach for decentralized and cooperative workflow scheduling in a dynamic and distributed Grid resource sharing environment.  ...  In order to show the performance of the proposed approach against non-cooperative scheduling approach, we conduct experiment for different sizes of workflow.  ...  for 7: 8: Calculate data transfer time for e according to (2) 9: end for 10: Run BFS following reverse task dependency and calculate rank value for each task according to (3) (4) 11: end  ... 
doi:10.1016/j.future.2009.07.002 fatcat:5d4hx5tayjd65ndgb6kgsassa4

GARNET: A holistic system approach for trending queries in microblogs

Christopher Jonathan, Amr Magdy, Mohamed F. Mokbel, Albert Jonathan
2016 2016 IEEE 32nd International Conference on Data Engineering (ICDE)  
Most importantly, their narrow scope, as they focus only on solving trending queries for a very special case of localized and very recent microblogs.  ...  Experimental evidence based on a real system prototype of GARNET and billions of real Twitter data show the scalability and efficiency of GARNET for various query types.  ...  algorithm for general trending queries [16] , and so on.  ... 
doi:10.1109/icde.2016.7498329 dblp:conf/icde/Jonathan0MJ16 fatcat:kdrlwseqybahdg3wj67nwa5bc4
« Previous Showing results 1 — 15 out of 5,121 results