Skyline query processing for uncertain data

Khalefa, Mohamed E.; Mokbel, Mohamed F.; Levandoski, Justin J.

doi:10.1145/1871437.1871604

Cited by 30 publications

(27 citation statements)

References 20 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some studies [1,4,24] solved skyline queries in distributed environments and there are some works about skyline queries with uncertain data sets [14,21,24,33]. …”

Section: Traditional Skyline Processingmentioning

confidence: 99%

See 1 more Smart Citation

The subspace global skyline query processing over dynamic databases

et al. 2016

View full text Add to dashboard Cite

The global skyline, as an important variant of the skyline, has been widely applied in multi-criteria decision making, business planning and data mining. In this paper, we extend our early work and propose the maintenance methods to process the subspace global skyline (SGS) queries in dynamic databases. In the previous work, we proposed the index structure RB-tree, which can effectively manage the data to accelerate the subspace global skyline calculation. Also, the basic single SGS algorithm based on RB-tree (SSRB) and the optimized single SGS algorithm (OSSRB) were proposed to process a single SGS query. In addition, the multiple SGS algorithm (MSRB) was proposed to calculate multiple SGS queries by sharing the scan spaces of different queries. In this paper, we design some data structures and propose the maintenance approaches of SSRB, OSSRB and MSRB to cope with updates that happen to data sets. Thus our extended algorithms can be adopted for dynamic data sets. Finally, the experimental results show that the proposed algorithms OSSRB and MSRB have good performance to process SGS queries and they can be easily maintained with dynamic datasets.

show abstract

“…Some studies [1,4,24] solved skyline queries in distributed environments and there are some works about skyline queries with uncertain data sets [14,21,24,33]. …”

Section: Traditional Skyline Processingmentioning

confidence: 99%

“…If d has been scanned for |S q | times, the calculations of orthants which d belongs to are finished (lines 12,13). If the calculations of all the orthants are finished, we can get the final SGS points (lines 14,15). …”

Section: Lemma 2 [2]mentioning

confidence: 99%

The subspace global skyline query processing over dynamic databases

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Balke et al [2] solved the skyline query in distributed environment and there are some works about skyline query in uncertain data set [19,8,13]. …”

Section: Traditional Skyline Processingmentioning

confidence: 99%

“…If we scan only one data point at one time, there is only one point in D ′ , do not need to be deleted. Then we deal with each data point in D ′ (lines [6][7][8][9][10][11][12][13][14][15][16][17][18]. If d is scanned at first time (lines 8-15), we should judge which octants d belongs to (line 10), then compute whether d is sgdominated by the data points in 11,12).…”

Section: Algorithm 1 Ssrb Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Subspace global skyline query processing

Bai

Xin

Wang

2013

Proceedings of the 16th International Conference on Extending Database Technology

View full text Add to dashboard Cite

Global skyline, as an important variant of skyline, has been widely applied in multiple criteria decision making, business planning and data mining, while there are no previous studies on the global skyline query in the subspace. Hence in this paper we propose subspace global skyline (SGS) query, which is concerned about global skyline in ad hoc subspace. Firstly, we propose an appropriate index structure RB-tree to rapidly find the initial scan positions of query. Secondly, by making analysis of basic properties of SGS, we propose a single SGS algorithm based on RB-tree (SSRB) to compute SGS points. Then an optimized single SGS algorithm based on RB-tree (OSSRB) is proposed, which can reduce the scan space and improve the computation efficiency in contrast to SSRB. Next, by sharing the scan space of different queries, a multiple SGS algorithm based on RB-tree (MSRB) is proposed to compute multiple SGS (MSGS). Finally, the performances of our proposed algorithms are verified through a large number of simulation experiments.

show abstract

Efficient skyline computation over distributed interval data

Ren

2017

Concurrency and Computation

View full text Add to dashboard Cite

Summary The increasing volume of uncertain data has resulted in a dire need for supporting efficient uncertain data management. The skyline query as an important aspect of data management has received considerable attention in recent years, because of its importance in making intelligent decisions over complex data. Moreover, data collection and storage have become increasingly distributed, which makes the central assembly of data for storage and query infeasible and inefficient. Although many research efforts have been conducted to address the skyline query problem in various distributed scenarios, we still lack algorithms to address the queries over interval data, which is a special kind of attribute‐level uncertain data that widely exists in many applications. In this paper, we extensively study the skyline query over distributed interval data. We model the skyline query problem and define the distributed skyline query over interval data. Particularly, 2 efficient algorithms are proposed to retrieve the skylines progressively from distributed local sites with a highly optimized feedback framework. Moreover, we exploit 2 strategies for further improving the queries. Extensive experiments on synthetic and real datasets with real deployment are conducted to validate the effectiveness and efficiency of our proposals.

show abstract

Skyline query processing for uncertain data

Cited by 30 publications

References 20 publications

The subspace global skyline query processing over dynamic databases

The subspace global skyline query processing over dynamic databases

Subspace global skyline query processing

Efficient skyline computation over distributed interval data

Contact Info

Product

Resources

About