Filters








30 Hits in 4.6 sec

A Survey of Skyline Query Processing [article]

Christos Kalyvas, Theodoros Tzouramanis
2017 arXiv   pre-print
This paper surveys the state-of-the-art techniques for skyline query processing, the numerous variations of the initial algorithm that were proposed to solve similar problems and the application-specific  ...  Based on this the skyline query was proposed which is a decision support mechanism, that retrieves the valuefor- money options of a dataset by identifying the objects that present the optimal combination  ...  The second part analyzes the various applications of skyline queries along with the state-of-the-art algorithms for each sub-field of research.  ... 
arXiv:1704.01788v1 fatcat:g45oxbmrznhqtmcpabud3sap7e

Skyline Computation with Noisy Comparisons [chapter]

Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo
2020 Lecture Notes in Computer Science  
In this model motivated by Crowdsourcing applications, Groz and Milo [18] show three bounds on the query complexity for the skyline problem.  ...  We improve significantly on that state of the art and provide two output-sensitive algorithms computing the skyline with respective query complexity O(ndlog(dk/δ)) and O(ndklog(k/δ)), where k is the size  ...  This leads to more efficient algorithms because smaller skylines are easier to compute.  ... 
doi:10.1007/978-3-030-48966-3_22 fatcat:ezxphq7uyfctfdr5ibr56qtene

Efficient Geometric Pruning Strategies for Continuous Skyline Queries

Jiping Zheng, Jialiang Chen, Haixiang Wang
2017 ISPRS International Journal of Geo-Information  
The skyline query processing problem has been well studied for many years. The literature on skyline algorithms so far mainly considers static query points on static attributes.  ...  Various geometric strategies are asymptotically proposed to prune the querying dataset, and event-driven mechanisms are adopted to process continuous skyline queries.  ...  Since the BBS algorithm is the most efficient method for computing skyline in static settings (both data points and query point are static), we adopted it for comparison in the experiments.  ... 
doi:10.3390/ijgi6030091 fatcat:po45g6vxbzfx7csh7ztbtdvmxq

Skyline Queries with Noisy Comparisons

Benoit Groz, Tova Milo
2015 Proceedings of the 34th ACM Symposium on Principles of Database Systems - PODS '15  
We study in this paper the computation of skyline queries -a popular tool for multicriteria data analysis -in the presence of noisy input.  ...  Motivated by crowdsourcing applications, we present the first algorithms for skyline evaluation in a computation model where the input data items can only be compared through noisy comparisons.  ...  Then each oracle call for dominance test can be processed in O(log(k)) rounds. This yields a total of O(k · log log n · logk) rounds for SkySample, hence the result.  ... 
doi:10.1145/2745754.2745775 dblp:conf/pods/GrozM15 fatcat:w5o2xbznobfpfg4fhvsgaqrl2m

Algorithm for Computing Convex Skyline Objectsets on Numerical Databases

Md. Anisuzzaman SIDDIQUE, Yasuhiko MORIMOTO
2010 IEICE transactions on information and systems  
We propose an efficient algorithm to compute convex skyline of the n C s sets. We call the retrieve skyline objectsets as "convex skyline objectsets".  ...  Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper.  ...  Algorithm for Convex Skyline Objectsets In this section, we present an algorithm for computing convex skyline s-objectsets.  ... 
doi:10.1587/transinf.e93.d.2709 fatcat:d3mdiirdhbg4pjhlq4p63oyxoy

Randomized multi-pass streaming skyline algorithms

Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Jun Xu
2009 Proceedings of the VLDB Endowment  
We consider external algorithms for skyline computation without pre-processing. Our goal is to develop an algorithm with a good worst case guarantee while performing well on average.  ...  Using the tools of randomness, proved to be useful in many applications, we present an efficient multi-pass streaming algorithm, RAND, for skyline computation.  ...  Lipton for useful discussions, Donald Kossman, Michael Morse, Bernard Seeger, and Yufei Tao for sharing code and data sets, and Sungwoo Park for sharing a manuscript of his work.  ... 
doi:10.14778/1687627.1687638 fatcat:6wjz6lkxmzdvlexxppnpz3apga

Skyline Computation with Noisy Comparisons [article]

Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo
2020 arXiv   pre-print
In this model motivated by Crowdsourcing applications, Groz Milo [GM15] show three bounds on the query complexity for the skyline problem.  ...  We improve significantly on that state of the art and provide two output-sensitive algorithms computing the skyline with respective query complexity O(ndlog (dk/δ)) and O(ndklog (k/δ)) where k is the size  ...  This leads to more efficient algorithms because smaller skylines are easier to compute.  ... 
arXiv:1710.02058v2 fatcat:v5nlsurlfvgzdjoxs6so5chk5m

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
In this paper, we study efficient algorithms for processing DPS queries in large road networks.  ...  , and (iii) algorithms for processing interval queries.  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika

Range search on multidimensional uncertain data

Yufei Tao, Xiaokui Xiao, Reynold Cheng
2007 ACM Transactions on Database Systems  
We also develop efficient algorithms to compute SKYCUBE, skyline groups and their decisive subspaces.  ...  How can we effectively analyze the subspace skylines? Can we efficiently compute skylines in various subspaces and answer various analytical queries?  ...  ACKNOWLEDGMENTS The authors are grateful to the reviewers for their careful and insightful reviews, and to Dr. Donald Kossmann for providing us the synthetic data generator.  ... 
doi:10.1145/1272743.1272745 fatcat:atlcjuli3zh7dhshw5rqfafhyq

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

Ihab F. Ilyas, George Beskales, Mohamed A. Soliman
2008 ACM Computing Surveys  
Efficient processing of top-k queries is a crucial requirement in many interactive environments that involve massive amounts of data.  ...  In particular, efficient top-k processing in domains such as the Web, multimedia search and distributed systems has shown a great impact on performance.  ...  ., storage, indexing and query processing) are leveraged to allow for efficient top-k processing.  ... 
doi:10.1145/1391729.1391730 fatcat:2vbe23sy3fedzjdqspbni3ul3y

Determining the Impact Regions of Competing Options in Preference Space

Bo Tang, Kyriakos Mouratidis, Man Lung Yiu
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
We refer to our problem as k-Shortlist Preference Region identification (kSPR), and exploit its computational geometric nature to develop a framework for its efficient (and exact) processing.  ...  In rank-aware processing, user preferences are typically represented by a numeric weight per data attribute, collectively forming a weight vector.  ...  Many algorithms have been proposed for skyline processing with and without indices [29, 21, 25] .  ... 
doi:10.1145/3035918.3064044 dblp:conf/sigmod/TangMY17 fatcat:ztm6j5wgtvh2rbud3ludwhchiu

Welcome Message from the General Chair

2006 International Conference on Dependable Systems and Networks (DSN'06)  
Thanks to the efforts of programme committees, authors, and the VLDB Endowment over the years, VLDB conferences constitute today a prestigious scientific forum for the presentation and exchange of research  ...  We are grateful to all members of these committees for their time and efforts.  ...  contents presented in this document would not have been available to the attendees of the VLDB conference without the contributions of Mike Godfrey (MG) and Dave Wortman (DW), who compiled similar guides for  ... 
doi:10.1109/dsn.2006.75 dblp:conf/dsn/X06 fatcat:k4duddvbk5glboxkqxkkfsh4p4

Approximation schemes for many-objective query optimization

Immanuel Trummer, Christoph Koch
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
The proposed algorithms are based on a formal analysis of typical cost functions that occur in the context of MOQO.  ...  We integrated all MOQO algorithms into the Postgres optimizer and present experimental results for TPC-H queries; we extended the Postgres cost model and optimize for up to nine conflicting objectives  ...  Work on Skyline Queries [18] and Optimization Queries [13] focuses on query processing while we focus on query optimization. Our work is situated in the broader area of Approximation Algorithms.  ... 
doi:10.1145/2588555.2610527 dblp:conf/sigmod/TrummerK14 fatcat:ajbghzyigvddtm3bjz3xlhnwya

Approximation Schemes for Many-Objective Query Optimization [article]

Immanuel Trummer, Christoph Koch
2014 arXiv   pre-print
The proposed algorithms are based on a formal analysis of typical cost functions that occur in the context of MOQO.  ...  We integrated all MOQO algorithms into the Postgres optimizer and present experimental results for TPC-H queries; we extended the Postgres cost model and optimize for up to nine conflicting objectives  ...  Work on Skyline Queries [18] and Optimization Queries [13] focuses on query processing while we focus on query optimization. Our work is situated in the broader area of Approximation Algorithms.  ... 
arXiv:1404.0046v1 fatcat:2yq6kzaiwnhcrlz44xmlwjmuum

Adversarial-knowledge dimensions in data privacy

Bee-Chung Chen, Kristen LeFevre, Raghu Ramakrishnan
2008 The VLDB journal  
Based on this property, we provide algorithms for measuring disclosure and sanitizing data that improve computational efficiency several orders of magnitude over the best known techniques.  ...  In this paper, we first describe a general framework for reasoning about privacy in the presence of adversarial knowledge.  ...  By Proposition 2, within each QI-group g, for each distinct sensitive value x ∈ X g , we reconstruct the multiset of individuals having sensitive value x independently.  ... 
doi:10.1007/s00778-008-0118-x fatcat:dbcm3rnyq5amvgy7moz4bghxfq
« Previous Showing results 1 — 15 out of 30 results