Name
Abstract | ||
|---|---|---|
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declustering schemes that are optimal for all spatial range queries. As a result of this, most of the research on declustering has focused on finding schemes with low worst case additive error. However, additive error based schemes have many limitations including lack of progressive guarantees and existence of small non-optimal queries. In this paper, we take a different approach and propose threshold-based declustering. We investigate the threshold k such that all spatial range queries with = |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ins.2006.08.011 | Inf. Sci. |
Keywords | Field | DocType |
multiple device,declustering scheme,spatial range query,threshold-based declustering,progressive guarantee,low worst case additive,different approach,additive error,declustering technique,query response time,query optimization,range queries,range query,upper bound | Data mining,Computer science,Range query (data structures),Response time,Theoretical computer science,Parallel I/O | Journal |
Volume | Issue | Citations |
177 | 5 | 5 |
PageRank | References | Authors |
0.42 | 35 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ali Şaman Tosun | 1 | 190 | 10.03 |