Close Dominance Graph: An Efficient Framework for Answering Continuous Top-&lt;inline-formula&gt; &lt;tex-math notation="TeX"&gt;\(k\) &lt;/tex-math&gt;&lt;/inline-formula&gt; Dominating Queries

Santoso, Bagus Jati; Chiu, Ge-Ming

doi:10.1109/tkde.2013.172

Cited by 29 publications

(6 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This study is close to our methods to construct DG and it can be said that the DG in our study is a special case of Zou's DG. The other study that utilizes the dominant graph is done by [25] in 2014. It is to answer continuous top-k queries and the graph is called by Close Dominant Graph (CDG).…”

Section: Related Workmentioning

confidence: 99%

Upgrading Products based on Existing Dominant Competitors

Wijayanto

Thamrin²,

Chen

2021

Proceedings of the Annual Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

In the Industry 4.0 era, manufacturers compete to produce better products that are expected to satisfy a larger number of customers. We propose a recommendation system for upgrading products considering user preferences. This approach is based on the dominating regions of dominant competitors. The dominating region represents the estimation of the number of potential customers. However, examining overlapped dominating regions for a high dimensional space is NP-hard. We propose a novel method named TDRDFS which constructs a Dominant Graph of Intersection skyline points (DGI) for modeling the dominating regions. Our experiments show that TDRDFS significantly reduces computation. Based on our approach, product vendors are able to determine the strategy of upgrading products easily.

show abstract

Section: Related Workmentioning

confidence: 99%

Upgrading Products based on Existing Dominant Competitors

Wijayanto

Thamrin²,

Chen

2021

Proceedings of the Annual Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

show abstract

“…Similarly, when we encounter a non-leaf node e, we check each child entry e r P e (lines [27][28][29][30]. If it holds that e r .U B ď τ i , then we can safely prune node e r ; otherwise, we insert entry (e r , -e r .U B) into heap H for further checking (lines [29][30].…”

Section: Algorithm 2: Filtering-mapper Function On Partition D Imentioning

confidence: 99%

“…In addition, there are some other variants of top-k dominating queries over certain data, such as the top-k dominating query assuming that objects are vertically decomposed [14,33], that in the metric space [34], continuous top-k dominating query [30], and so on. Top-k Dominating Query on Uncertain Data.…”

Section: Top-k Dominating Query On Centralized Certain/uncertain Datamentioning

confidence: 99%

Probabilistic Top-k Dominating Queries in Distributed Uncertain Databases (Technical Report)

Rai¹,

Lian²

2021

Preprint

View full text Add to dashboard Cite

In many real-world applications such as business planning and sensor data monitoring, one important, yet challenging, task is to rank objects (e.g., products, documents, or spatial objects) based on their ranking scores and efficiently return those objects with the highest scores. In practice, due to the unreliability of data sources, many real-world objects often contain noises and are thus imprecise and uncertain. In this paper, we study the problem of probabilistic top-k dominating (PTD) query on such large-scale uncertain data in a distributed environment, which retrieves k uncertain objects from distributed uncertain databases (on multiple distributed servers), having the largest ranking scores with high confidences. In order to efficiently tackle the distributed PTD problem, we propose a MapReduce framework for processing distributed PTD queries over distributed uncertain databases. In this MapReduce framework, we design effective pruning strategies to filter out false alarms in the distributed setting, propose cost-model-based index distribution mechanisms over servers, and develop efficient distributed PTD query processing algorithms. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed distributed PTD approaches on both real and synthetic data sets through various experimental settings.

show abstract

“…To boost efficiency, Yiu and Mamoulis [6], [7] propose two approaches based on the aR-tree to tackle the TKD query. More recently, some new variants of TKD queries are studied, including subspace dominating query [21], continuous top-k dominating query [22], [23], metric-based top-k dominating query [9], topk dominating query on massive data [24], etc.…”

Section: Top-k Dominating Queriesmentioning

confidence: 99%

“…For real datasets, we employ MovieLens, NBA, and Zillow that are widely utilized in many previous works on dominance problem [1], [2], [5], [7], [8], [9], [21], [22], [23]. (i) MovieLens contains 3,700 movie records, with each having 60 dimensions representing the ratings from 60 audiences.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Top-<italic>k</italic> Dominating Queries on Incomplete Data

Miao

Gao

Zheng

et al. 2016

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

The top-k dominating (TKD) query returns the k objects that dominate the maximum number of objects in a given dataset. It combines the advantages of skyline and top-k queries, and plays an important role in many decision support applications. Incomplete data exists in a wide spectrum of real datasets, due to device failure, privacy preservation, data loss, and so on. In this paper, for the first time, we carry out a systematic study of TKD queries on incomplete data, which involves the data having some missing dimensional value(s). We formalize this problem, and propose a suite of efficient algorithms for answering TKD queries over incomplete data. Our methods employ some novel techniques, such as upper bound score pruning, bitmap pruning, and partial score pruning, to boost query efficiency. Extensive experimental evaluation using both real and synthetic datasets demonstrates the effectiveness of our developed pruning heuristics and the performance of our presented algorithms.

show abstract

Close Dominance Graph: An Efficient Framework for Answering Continuous Top-<inline-formula> <tex-math notation="TeX">\(k\) </tex-math></inline-formula> Dominating Queries

Cited by 29 publications

References 33 publications

Upgrading Products based on Existing Dominant Competitors

Upgrading Products based on Existing Dominant Competitors

Probabilistic Top-k Dominating Queries in Distributed Uncertain Databases (Technical Report)

Top-<italic>k</italic> Dominating Queries on Incomplete Data

Contact Info

Product

Resources

About