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.
Filters
Efficient Maintenance of all k-Dominant Skyline Query Results for Frequently Updated Database
unpublished
Preserved Fulltext
This paper addresses the problem of maintaining k-dominant skyline objects for frequently updated database. We propose an algorithm for maintaining k-dominant skyline objects. ...
Though it can reduce the number of retrieved objects, the k-dominant skyline objects are difficult to maintain if the database is updated. ...
Anisuzzaman Siddique was supported by the scholarship of MEXT Japan. ...
fatcat:bknlihljjfbnves54hiscdvmpa
Continuous k-Dominant Skyline Computation by Using Divide and Conquer Strategy
2010
IPSJ Online Transactions
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.
This paper addresses the problem of efficient maintenance of k-dominant skyline objects of frequently updated database. ...
On the other hand, the maintenance of k-dominant skyline objects under continuous updates is much more difficult compared to conventional skyline objects. ...
Anisuzzaman Siddique was supported by the scholarship of MEXT Japan. ...
doi:10.2197/ipsjtrans.3.97
fatcat:hbvsdhaturhfbch42xsi7qoev4
Continuous Processing of Preference Queries in Data Streams
[chapter]
2010
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.
In this paper, we examine the characteristics of important preference queries, such as skyline, top-k and top-k dominating and we review algorithms proposed for the evaluation of continuous preference ...
Nowadays, a significant number of applications require the manipulation of time evolving data and therefore the study of continuous query processing has recently attracted the interest of the data management ...
In [26] , the authors studied efficient algorithms for top-k dominating query processing in uncertain databases. ...
doi:10.1007/978-3-642-11266-9_4
fatcat:wbfgvvzlqjcsjfl3ondsaeuj7q
Grid-PPPS: A Skyline Method for Efficiently Handling Top-kQueries in Internet of Things
2014
Journal of Applied Mathematics
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new skyline method (called Grid-PPPS) for efficiently handling top-kqueries in IoT applications. ...
There are many methods to answer top-kqueries, where skyline methods are efficient when considering all attribute values of tuples. ...
In this paper, we focus on reducing the index construction of skyline in which data is frequently updated.
Skyline Methods. ...
doi:10.1155/2014/401618
fatcat:hr4w3lttu5hknbmxxvyulzlbji
DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation
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 2007; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. ...
Previous work suggested the use of the so called exclusive dominance region (EDR) to achieve optimal I/O performance for deletion maintenance. ...
As on-going work, we are investigating the usage of auxiliary data for skyline view maintenance and the efficient maintenance of skyline cubes for batch updates. ...
doi:10.1109/icde.2007.367894
dblp:conf/icde/WuAEA07
fatcat:7rq2pysribhttlf4acubidcqdy
Minimizing the communication cost for continuous skyline maintenance
2009
Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09
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 2009; you can also visit the original URL.
The file type is application/pdf.
Filter can be easily adapted to FSQW processing, however, with potentially high overhead for large and frequently updated datasets. ...
Filter achieves significant savings over the naive approach of transmitting all updates. Going one step further, we introduce the concept of frequent skyline query over a sliding window (FSQW). ...
RELATED WORK The skyline operator was first introduced to the database community in [3] . Since then a large number of algorithms have been proposed for conventional databases. ...
doi:10.1145/1559845.1559898
dblp:conf/sigmod/ZhangCPT09
fatcat:eg66xtt42bdc5hzkgzllcyzmsy
SkyMap: A Trie-Based Index Structure for High-Performance Skyline Query Processing
[chapter]
2011
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.
superior scalability even for higher dimensions, and low costs for maintenance in face of data updates. ...
Skyline queries have become commonplace in many applications. The main problem is to efficiently find the set of Pareto-optimal choices from a large amount of database items. ...
Indexes are indeed the key for broad database support for efficient skyline compution. ...
doi:10.1007/978-3-642-23091-2_30
fatcat:cdaia2jg6ndrncijya5gt4krgu
Efficient Dynamic Service Maintenance for Edge Services
2018
IEEE Access
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 2019; you can also visit the original URL.
The file type is application/pdf.
Specifically, the Skyline Graph (SG) algorithm is designed to solve the insertion, deletion, updating and searching of mobile edge services to achieve efficient maintenance for edge services. ...
As a result, an effective mechanism is needed for providing efficient dynamic service maintenance for edge services. ...
Zhang et al.: Efficient Dynamic Service Maintenance for Edge Services ...
doi:10.1109/access.2018.2806391
fatcat:4t6pcv2wtbavxbrkjz54sa7u7u
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
2008
2008 IEEE 24th 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.
In this paper, we investigate the intrinsic connection between top-k queries and dominant relationship between records, and based on which, we propose an efficient layer-based indexing structure, Dominant ...
For example, the search space in our algorithm is less than 1 5 of that in AppRI [1], one of state art of top-k algorithms. Furthermore, our method can support any aggregate monotone query function. ...
However, using temporal solutions, the quality of AppRI index will degrade with frequent updates. ...
doi:10.1109/icde.2008.4497462
dblp:conf/icde/ZouC08
fatcat:wrw343cv5zaw5lszdo23fqmuu4
Refreshing the sky
2006
Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06
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 2006; you can also visit the original URL.
The file type is application/pdf.
This paper focuses on supporting concurrent and unpredictable subspace skyline queries in frequent updated databases. ...
Given a set of d-dimensional objects, the skyline query finds the objects that are not dominated by others. ...
Comparing to the skycube, we trade some of the query efficiency for better storage and more efficient maintenance of CSC upon updates. ...
doi:10.1145/1142473.1142529
dblp:conf/sigmod/XiaZ06
fatcat:ebniwr5nczgcjazbpszhddqgja
Online Interval Skyline Queries on Time Series
2009
Proceedings / 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.
For a set of time series and a given time interval [i : j], an interval skyline query returns the time series which are not dominated by any other time series in the interval. ...
Through theoretical analysis and extensive experiments, we show that both methods only require linear space and are efficient in query answering as well as incremental maintenance. ...
All opinions, findings, conclusions and recommendations in this paper are those of the authors and do not necessarily reflect the views of the funding agencies. ...
doi:10.1109/icde.2009.70
dblp:conf/icde/JiangP09
fatcat:mmsmx3eqq5gmpbabfbmffrj73u
Continuous Skyline Queries for Moving Objects
2006
IEEE Transactions on Knowledge and 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 2008; you can also visit the original URL.
The file type is application/pdf.
Second, we investigate the connection between the spatial positions of data points and their dominance relationship, which provides an indication of where to find changes in the skyline and how to maintain ...
With the increasing number of mobile service applications and users, however, the need for continuous skyline query processing has become more pressing. ...
Assuming that pt 2 leaves the skyline after t x , there must be another skyline point s dominating it, i.e., dist(q, s) < dist(q, pt 2 ) for t > t x and ∀k, s.p k ≤ pt 2 .p k . ...
doi:10.1109/tkde.2006.185
fatcat:4gx4g4q7dvdnxmq3qvig3thz3q
Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead
2016
IEICE transactions on information and systems
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.
Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. ...
In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. ...
to updates (less frequent). ...
doi:10.1587/transinf.2015edp7377
fatcat:duarhticyrbilbvbbx3a2wsm6u
Maintaining sliding window skylines on data streams
2006
IEEE Transactions on Knowledge and 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 2006; you can also visit the original URL.
The file type is application/pdf.
Our techniques utilize several interesting properties of stream skylines to improve space/time efficiency by expunging data from the system as early as possible (i.e., before their expiration). ...
Furthermore, we analyze the asymptotical performance of the proposed solutions, and evaluate their efficiency with extensive experiments. ...
ACKNOWLEDGMENTS Yufei Tao was jointly supported by a grant (project NO: 9360088) and another SRG grant (project NO: 7001843) from the City University of Hong Kong, and RGC Grant CityU 1163/04E from HKSAR ...
doi:10.1109/tkde.2006.48
fatcat:ec4ycodptfhm3dgcczhe64btdq
Efficiently Processing Continuous k-NN Queries on Data Streams
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 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an efficient method for exact k-NN monitoring. ...
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber systems. ...
For indexing the queries these structures are not flexible enough to support frequent updates and lead to a memory overhead which is not necessary. ...
doi:10.1109/icde.2007.367861
dblp:conf/icde/BohmOPY07
fatcat:5ubuuhmyg5gyrhyj7dbtwvv6ne
« Previous
Showing results 1 — 15 out of 400 results