Cost-Aware Skyline Queries in Structured Overlays

Karnsteclt, M.; Müller, Julius; Sattler, Kai-Uwe

doi:10.1109/icdew.2007.4401006

“…There is a need to provide exact completeness estimation for all of these types. An example for processing techniques relying on range queries and an exact completeness estimation are skyline queries [6,10]. One step during the processing of these queries is to initiate range queries for each of the queried attributes -and continuing with subsequent processing steps after all (or a satisfyingly large fraction) range query replies are received.…”

Section: Applying Completeness Estimationmentioning

confidence: 99%

“…For instance, query operators like aggregation or ranking-based queries (e.g., skyline queries [6,10]) require to know when all input data is arrived in order to calculate the aggregate value or to sort the input.…”

Section: Introductionmentioning

confidence: 99%

Completeness Estimation of Range Queries in Structured Overlays

Karnstedt

¹

,

Sattler

²

,

Schmidt

³

2007

Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)

Self Cite

View full text Add to dashboard Cite

Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. But, due to the limited knowledge and the usually best-effort characteristics, deciding about the completeness of query results, e.g., getting an idea when a query is finished or what amount of results is still missing, is very challenging. There is not only an urgent need to provide this information to the user issuing queries, but also for implementing sophisticated and efficient processing techniques based on them. In this work, we propose a method for solving this task. We discuss the applicability and quality of our estimations, present an implementation and evaluation for the P-Grid system and show how to adapt the technique to other overlays.Seventh IEEE International Conference on Peer-to-Peer Computing 0-7695-2986-0/07 $25.00

show abstract

“…The several sub-skylines are then again combined by a synchronizing node, which also computes the final global skyline. For further details we refer to [36,8,37].This approach works also for more than two dimensions, with only slight extensions required. Note that there exist different approaches for narrowing the search space, e.g., SkyFrame [38].…”

Section: Ranking Operatorsmentioning

confidence: 99%

“…A special skyline operator Φ can use a related approach [36]. The idea of the FrameSkyline is based on the observation that the search space for a skyline query result can be narrowed by using the minimal and maximal values of the involved attributes.…”

Section: Ranking Operatorsmentioning

confidence: 99%

Scalable distributed indexing and query processing over Linked Data

Karnstedt

¹

,

Sattler

²

,

Hauswirth

³

2012

Journal of Web Semantics

Self Cite

View full text Add to dashboard Cite

Completeness Estimation of Range Queries in Structured Overlays

Karnstedt¹,

Sattler²,

Schmidt

³

2007

Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)

Self Cite

2

0

View full text Add to dashboard Cite

Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. But, due to the limited knowledge and the usually best-effort characteristics, deciding about the completeness of query results, e.g., getting an idea when a query is finished or what amount of results is still missing, is very challenging. There is not only an urgent need to provide this information to the user issuing queries, but also for implementing sophisticated and efficient processing techniques based on them. In this work, we propose a method for solving this task. We discuss the applicability and quality of our estimations, present an implementation and evaluation for the P-Grid system and show how to adapt the technique to other overlays.

show abstract

Cost-Aware Skyline Queries in Structured Overlays

Cited by 7 publications

References 14 publications

Completeness Estimation of Range Queries in Structured Overlays

Completeness Estimation of Range Queries in Structured Overlays

Scalable distributed indexing and query processing over Linked Data

Completeness Estimation of Range Queries in Structured Overlays

Contact Info

Product

Resources

About