ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Compressive Analysis on Skyline Computations with Partially Ordered Domains Using Indexing Techniques

Journal: International Journal of Engineering and Techniques (Vol.4, No. 2)

Publication Date:

Authors : ;

Page : 706-712

Keywords : Indexing Methods; Query Processing; Multi Keywords: -Dimensional Databases; Data Management.;

Source : Downloadexternal Find it from : Google Scholarexternal


Proficient processing of skyline queries with partially ordered domains has been seriously addressed in recent years. To further reduce the query processing time to support high-responsive applications, the skyline queries that were previously processed with user preferences similar to those of the new query contribute helpful hopeful result focuses. Thus, the answered queries can be stored with both their results and the user preferences to such an extent that the query processor can rapidly retrieve the result for another query only from the result sets of reserved queries with perfect user preferences. While storing a noteworthy number of queries amassed over time, it is basic to receive compelling access methods to record the reserved queries to retrieve an arrangement of relevant reserved queries for encouraging the reserve based skyline query computations. In this paper, we propose a broadened depth-first search indexing method (e-DFS for short) for getting to user preference profiles represented by directed acyclic graphs (DAGs), and stress the outline of the e-DFS encoding that adequately encodes a user preference profile into a low-dimensional feature point which is in the long run filed by a R-tree. We acquire one or more traversal orders for every hub in a DAG by traversing it through a changed version of the depth-first search which is used to inspect the topology structure and strength relations to measure closeness or similarity. As a result, e-DFS which joins the criteria of similarity evaluation can greatly reduce the search space by filtering out a large portion of the irrelevant reserved queries with the end goal that the query processor can abstain from getting to the entire informational collection to register the query results. Broad experiments are presented to demonstrate the performance and utility of our indexing method, which outperforms the gauge arranging strategies by reducing 37% of the computational time on average.

Last modified: 2018-07-06 16:35:37