A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Scalable and I/O Optimal Skyline Processing Algorithm
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
It can be shown that the new algorithm is I/O optimal. ...
In this paper, we will present a novel progressive algorithm for computing skyline queries. The algorithm is based on the depth-first search paradigm. ...
DF S still works much better, since DF S works like a depth-first search algorithm.
Conclusion In this paper, we develop the algorithm DFS that are I/O cost optimal for the skyline queries. ...
doi:10.1007/978-3-540-27772-9_23
fatcat:uimq3lksvrgsfbszcuj6icljra
Netco
2018
Proceedings of the ACM Symposium on Cloud Computing - SoCC '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Experiments on a public cloud, with production-trace inspired workloads, show that Netco uses up to 5× less remote I/O compared to existing techniques and increases the number of jobs that meet their deadlines ...
Netco makes various decisions (what content to cache, when to cache and how to apportion bandwidth) to support end-toend optimization goals such as maximizing the number of jobs that meet their service-level ...
. • A novel problem formulation which jointly optimizes I/O bandwidth and local storage capacity in disaggregated architectures to meet job SLOs, and practical algorithms to solve it ( §4). • An evaluation ...
doi:10.1145/3267809.3267827
dblp:conf/cloud/JalapartiDGAFKM18
fatcat:a5iuiv5sfjcbpdbrzs3ud3ooqi
An Efficient Query Processing Algorithm for Multiple Constrained Skyline Queries
2013
International Journal of e-Education, e-Business, e-Management and e-Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on the BBS (Branch and Bound Skyline) algorithm, we design a Multiple-Constrained-Skyline-Query (MCSQ) algorithm than can speed-up the query processing performance for multiple constrained skyline ...
Index Terms-Constrained skyline queries, database, query processing, multi-query optimization. c a, b, c Access c d, e c Up to now, MCSQ behaves like BBS algorithm. ...
The advantages of our algorithm are decreased query processing time, and disk I/O cost, which in turn improves system scalability. ...
doi:10.7763/ijeeee.2013.v3.285
fatcat:vw2fpvlpdza45hcxvj72spcje4
Skyline queries: An introduction
2015
2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Several algorithms were proposed for skyline query processing, such as window-based, progressive, distributed, geometric-based, index-based, divideand-conquer, and dynamic programming algorithms. ...
As the number of objects that are returned in a skyline query may become large, there is also an extensive study for the cardinality of skyline queries. ...
The algorithm is I/O optimal and requires a logarithmic space in the worst case in the 2D space if there are not many overlaps in the R-tree.
IV. ...
doi:10.1109/iisa.2015.7388053
dblp:conf/iisa/TiakasPM15
fatcat:2khfwvtmt5ccdnxs5m5564h5jy
An Efficient Pre and Post Processing Skyline Computational Framework Using Mapreduce
2019
International journal of recent technology and engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Skyline query processing is not exceptional. Skyline processing with MapReduce will take lead role in skyline computation. ...
This paper contains our proposed Map Reduce - Pre and Post Filter based Skyline Computation (MR-PPFS). ...
This is an iterative process to identify the final skyline points. This task will reduce scalability of global skyline.
IV. EXPERIMENTAL SETUP AND ANALYSIS
A. ...
doi:10.35940/ijrte.b3587.078219
fatcat:2rtyn64b6fehzcttkrcq25dvw4
Parallel Execution of Data-intensive Web Services Based on Data-flow Constructs and I/O Operation Ratio
2014
International Journal of Database Theory and Application
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we put forward the approach to the composition of Web services based on the I/O operation ratio, in which the CPU intensive Web services and the I/O intensive ones are arranged to execute ...
Service-oriented architecture, on the other hand, offers a scalable and flexible framework to implement loosely-coupled and standards-based distribute computing which the data-intensive applications usually ...
Acknowledgments The work is supported by Natural Science Foundation of Zhejiang (No.LY12F02003), the Key Science and Technology Project of Zhejiang (No. 2012C11026-3) and the open ...
doi:10.14257/ijdta.2014.7.4.10
fatcat:zcddrfqxinb5rgggny2ngnaud4
An Efficient Index Method for the Optimal Route Query over Multi-Cost Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose a novel partition-based index with contour skyline techniques to find the optimal route. We propose a vertex-filtering algorithm to facilitate the query processing. ...
However, there always are several kinds of cost in networks and users prefer to select an optimal route under the global consideration of these kinds of cost. ...
This index is a treestructured index constructed based on the concept of vertex cover and it is I/O-efficient when the input graph is too large to fit in main memory. ...
arXiv:2004.12424v1
fatcat:aqsj5kbgobf2lhgb56jvwd4nke
Parallelizing Skyline Queries for Scalable Distribution
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a novel distributed skyline query processing algorithm (DSL) that discovers skyline points progressively. ...
Current skyline computation methods are restricted to centralized query processors, limiting scalability and imposing a single point of failure. ...
The best centralized method, BBS [19] , has been shown to be I/O optimal, and outperforms NN. ...
doi:10.1007/11687238_10
fatcat:slyp7lgcbjgczdkaosnhsnovkm
Z-SKY: an efficient skyline query processing framework based on Z-order
2009
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This framework consists of ZBtree, i.e., an index structure to organize a source dataset and skyline candidates, and a suite of algorithms, namely, (1) ZSearch, which processes skyline queries, (2) ZInsert ...
(5) k-ZSearch, which evaluates k-dominant skyline queries, and (6) ZSubspace, which supports skyline queries on a subset of dimensions. ...
Their costs are mainly constituted by I/O costs in accessing data from a tertiary storage (e.g., disks) and CPU costs spent on dominance tests. ...
doi:10.1007/s00778-009-0166-x
fatcat:wsto6whotzby3ayv64mej6woni
Evaluating skylines in the presence of equijoins
2010
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes a framework for evaluating skylines in the presence of equijoins, including: (1) the development of algorithms to answer such queries over large input tables in a non-blocking, pipeline ...
method for estimating the skyline selectivity of the joined table ; (3) evaluation of skyline computation based on the estimation method and the proposed evaluation techniques; and (4) a systematic experimental ...
[7] improved their work by applying a Branch-and-Bound Skyline (BBS) technique based on the best-first search in R-trees to produce an I/O optimal algorithm. Lin et al. ...
doi:10.1109/icde.2010.5447841
dblp:conf/icde/JinMPEH10
fatcat:j3vx7hjhsfdl7ldhcek2zy2tqq
Computing Influence of a Product through Uncertain Reverse Skyline
2017
Proceedings of the 29th International Conference on Scientific and Statistical Database Management - SSDBM '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We also present an e cient parallel approach to compute the uncertain reverse skyline and in uence score of a probabilistic product. ...
We present e cient pruning ideas and techniques for processing the uncertain reverse skyline query of a probabilistic product using R-Tree data index. ...
An optimized version of Algorithm 5 can also be achieved by executing optimized version of Algorithm 4 while computing the U RS of the query product q in line 2. ...
doi:10.1145/3085504.3085508
dblp:conf/ssdbm/0003RLAS17
fatcat:htvk3jpl3rcsbhowt6zt4lzhfi
General Spatial Skyline Operator
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
An efficient algorithm is proposed to significantly reduce the number of nonpromising objects in the computation. ...
In this paper, we study the problem of general spatial skyline which can provide a minimal set of candidates that contain optimal solutions for any monotonic distance based spatial preference query. ...
The work was supported by ARC grants(DP110104880, DP120104168, DE120102144) and ECR grant(PSE1799) ...
doi:10.1007/978-3-642-29038-1_36
fatcat:6p7ylw7ylndhjevf53gjeqcs5u
Selecting Stars: The k Most Representative Skyline Operator
2007
2007 IEEE 23rd International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To speed-up the computation, an efficient, scalable, index-based randomized algorithm is developed by applying the FM probabilistic counting technique. ...
We first present an efficient dynamic programming based exact algorithm in a 2d-space. ...
The work was partially supported by ARC-DP(DP0666428) and UNSW FRG(FRGP, PS08709). ...
doi:10.1109/icde.2007.367854
dblp:conf/icde/LinYZZ07
fatcat:iafohbbgnjew5hgpduaxnq6jjm
Discovering Attractive Products based on Influence Sets
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Skyline queries have been widely used as a practical tool for multi-criteria decision analysis and for applications involving preference queries. ...
In this work we develop novel algorithms for two important classes of queries involving customer preferences. We first propose a novel algorithm, termed as RSA, for answering reverse skyline queries. ...
These facts further justify our motivation for a more efficient and scalable algorithm for reverse skyline queries. ...
arXiv:1107.4924v1
fatcat:f2nj6zpvmrfdhjtngurkj3uune
Efficient influence-based processing of market research queries
2012
Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
I/O commonalities and enabling shared processing. ...
We then present a new algorithm, termed as RSA, that significantly reduces the I/O cost, as well as the computation cost, when compared to the state-of-the-art reverse skyline algorithm, while at the same ...
Acknowledgments This research has been co-financed by the European Union (European Social Fund -ESF) and Greek national funds through the Operational Program "Education and Lifelong Learning" of the National ...
doi:10.1145/2396761.2398420
dblp:conf/cikm/ArvanitisDV12
fatcat:4xjfl4dpxbej3aua2tyxs4ni2e
« Previous
Showing results 1 — 15 out of 333 results