112,933 Hits in 6.8 sec

Optimal top-k generation of attribute combinations based on ranked lists

Jiaheng Lu, Pierre Senellart, Chunbin Lin, Xiaoyong Du, Shan Wang, Xinxing Chen
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
In general, top-k,m queries are useful in scenarios where the problem of selecting combinations of attributes associated with ranked inverted lists naturally occurs.  ...  All inverted lists are ranked according to the scores of tuples. We are interested in selecting top-k combinations of attributes according to the corresponding top-m match instances of tuples.  ...  Generally speaking, top-k,m queries are of use in any context where one is interested in obtaining combinations of attributes associated with ranked lists.  ... 
doi:10.1145/2213836.2213883 dblp:conf/sigmod/LuSLDWC12 fatcat:2nh43ykcdbbnxalyqzhg4lqnbu

Supporting Top-k Join Queries in Relational Databases [chapter]

Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
2003 Proceedings 2003 VLDB Conference  
Ranking queries, also known as top-k queries, produce results that are ordered on some computed score.  ...  The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm.  ...  We would like to thank Ronald Fagin for helping us with the instance optimality analysis of the rank-join algorithm.  ... 
doi:10.1016/b978-012722442-8/50072-0 dblp:conf/vldb/IlyasAE03 fatcat:fly7wfewrveg5lom2arzorx4py

Top-k Query Processing Techniques in Uncertain Databases: A Review

Cherry Khosla, Parveen Kakkar
2015 International Journal of Computer Applications  
Ranking queries (often called as top-k) are useful in answering most important query answers in various domains such as web search, managing sensor data, location tracking, data mining tasks and multimedia  ...  In this survey paper, we describe and classify different top-k processing techniques in probabilistic databases and their implications.  ...  The top-k list should contain exactly k item b) Containment The top(k+1) list should contain all the elements of top-k. c) Unique rank The top-k list should contain each element exactly once.  ... 
doi:10.5120/21345-4358 fatcat:zazx3lvi2najdayttvujqmb3be

Supporting top-k join queries in relational databases

IhabF. Ilyas, WalidG. Aref, AhmedK. Elmagarmid
2004 The VLDB journal  
Ranking queries, also known as top-k queries, produce results that are ordered on some computed score.  ...  The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm.  ...  We would like to thank Ronald Fagin for helping us with the instance optimality analysis of the rank-join algorithm.  ... 
doi:10.1007/s00778-004-0128-2 fatcat:4x3zmmcarvbtlb7gaoferyfrku

Algebraic query optimization for distributed top-k queries

Thomas Neumann, Sebastian Michel
2007 Informatik - Forschung und Entwicklung  
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  ...  We have performed experiments on real web data that show the benefits of distributed top-k query optimization both in network resource consumption and query response time.  ...  S n )) and top-k produces the final top-k list (the rank based top-k operator).  ... 
doi:10.1007/s00450-007-0024-2 fatcat:vzxrrrnlj5g6va7vrwecglwt44

A survey of top-kquery processing techniques in relational database systems

Ihab F. Ilyas, George Beskales, Mohamed A. Soliman
2008 ACM Computing Surveys  
We show the implications of each dimension on the design of the underlying techniques. We also discuss top-k queries in XML domain, and show their connections to relational approaches.  ...  Efficient processing of top-k queries is a crucial requirement in many interactive environments that involve massive amounts of data.  ...  Voting systems are based on one or a combination of rank aggregation techniques.  ... 
doi:10.1145/1391729.1391730 fatcat:2vbe23sy3fedzjdqspbni3ul3y

Effi cacious and effi cient management systems

Jose Ailton Baptista Da Silva
1998 Total quality management (Print)  
In this work, we introduce the concept of rank uncertainty, a measure of work efficiency that enables classifying existing solutions according to their potential for efficient parallel in-memory Top-k  ...  Efficient Top-k query evaluation relies on practices that utilize auxiliary data structures to enable early termination.  ...  We would like to thank the anonymous reviewers for their constructive comments which contributed to the improvement of this paper.  ... 
doi:10.1080/0954412988938 fatcat:brokr6gd5vcu5eye4gqktbgyqy

Using semantic links to support top-K join queries in peer-to-peer networks

Jie Liu, Liang Feng, Hai Zhuge
2007 Concurrency and Computation  
A pruning-based local top-K ranking approach is proposed to reduce the transmitted data by pruning tuples that cannot produce the desired join results with a rank value at least equal to the lowest rank  ...  value generated.  ...  Figure 4 . 4 General architecture of the pruning-based local top-K ranking.  ... 
doi:10.1002/cpe.1145 fatcat:c2vnwnrjlban7fq3vfi6uhgcz4

Relevance-aware Filtering of Tuples Sorted by an Attribute Value via Direct Optimization of Search Quality Metrics

Nikita V. Spirin, Mikhail Kuznetsov, Julia Kiseleva, Yaroslav V. Spirin, Pavel A. Izhutov
2015 Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '15  
Hence, at the top of the list the users might see irrelevant results. In this paper we choose a different approach.  ...  We conduct a comprehensive evaluation of our algorithm on synthetic data and real learning to rank data sets.  ...  Third, the optimal subsequence for the prefix of length k is one of the optimal subsequences from each of the factor classes for the prefix of length k − 1 with or without the current element appended  ... 
doi:10.1145/2766462.2767822 dblp:conf/sigir/SpirinKKSI15 fatcat:ykbucu5dpfefxkatn4vzyn5uoe


Tianyi Wu, Dong Xin, Jiawei Han
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
However, there is a lack of study on supporting ranking queries in data warehouses where ranking is on multidimensional aggregates instead of on measures of base facts.  ...  To address this problem, we propose a query execution model to answer different types of ranking aggregate queries based on a unified, partial cube structure, ARCube.  ...  Next, we pull out the top guiding cell from each list and combine them to generate the first candidate cell, (a1, b2).  ... 
doi:10.1145/1376616.1376627 dblp:conf/sigmod/WuXH08 fatcat:iqy5f6fazje7flmvki4fxuh7c4

Integrating DB and IR Technologies: What is the Sound of One Hand Clapping?

Surajit Chaudhuri, Raghu Ramakrishnan, Gerhard Weikum
2005 Conference on Innovative Data Systems Research  
We discuss whether such a system needs to be designed from scratch, or can be incrementally built on top of existing architectures.  ...  IR systems, on the other hand, lack efficient support for handling structured parts of the data and metadata, and do not give the application developer adequate control over the ranking function.  ...  Top-k and At-least-k Operators The top-k operator proposed by [CK97, CK98] can be generalized to specify how many answers a user wants, but in the context of text, the ranking function can be quite complex  ... 
dblp:conf/cidr/ChaudhuriRW05 fatcat:ydjxahvpqbcqfgcvpuztjgxdiu

Ordering the attributes of query results

Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. Sudarshan
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06  
We formulate the problem as an optimization problem of choosing the most "useful" set of attributes, that is, the attributes that are most influential in the ranking of the items.  ...  There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank aggregation, and algorithms  ...  Techniques to find top-K results where the overall score is a combination of scores on individual attributes are described by Fagin et al. [11, 10] and Hristidis et al. [15] .  ... 
doi:10.1145/1142473.1142518 dblp:conf/sigmod/DasHKS06 fatcat:p2vvclsytnbu3hqvsccbzrppgq

Ranking Companies Based on Multiple Social Networks Mined from the Web [chapter]

Yingzi Jin, Yutaka Matsuo, Mitsuru Ishizuk
2010 E-commerce  
Table 6 shows the top 20 companies ranked by each attribute in the electrical industry field. Table 6 . Top 20 companies ranked by attributes of companies in the electrical industry.  ...  However, our purpose is learning of a ranking function (e.g.,, ranking of companies) based on social networks, which has a different optimization task.  ... 
doi:10.5772/8898 fatcat:hi4k54rdk5fejkig7abfixwgje

A Hybrid Multi-strategy Recommender System Using Linked Open Data [chapter]

Petar Ristoski, Eneldo Loza Mencía, Heiko Paulheim
2014 Communications in Computer and Information Science  
Our approach builds on training individual base recommenders and using global popularity scores as generic recommenders.  ...  The results of the individual recommenders are combined using stacking regression and rank aggregation.  ...  intra-list diversity (ILD), both on a top k list.  ... 
doi:10.1007/978-3-319-12024-9_19 fatcat:zi2gijk46fdnjpl3vyaqzn57ie

Rank-aware query optimization

Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey Scott Vitter, Ahmed K. Elmagarmid
2004 Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD '04  
We define ranking as an interesting property that triggers the generation of rank-aware query plans.  ...  Unlike traditional join operators, optimizing for rank-join operators depends on estimating the input cardinality of these operators.  ...  The output is the same set of objects ranked on a combination (aggregation) of these score attributes. We refer to this problem as top-k selection.  ... 
doi:10.1145/1007568.1007593 dblp:conf/sigmod/IlyasSAVE04 fatcat:tf3ss3wfv5cetia5gwdjqvfoty
« Previous Showing results 1 — 15 out of 112,933 results