O. Egecioglu and H. Ferhatosmanoglu. Circular data-space partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, pages 194--200, November 1999. 13 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimal Partitioning for Efficient I/O in Spatial Databases - Ferhatosmanoglu, Agrawal, .. Self-citation (Ferhatosmanoglu) (Correct)
No context found.
O. Egecioglu and H. Ferhatosmanoglu. Circular data-space partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, pages 194--200, November 1999. 13
Efficient Processing of Conical Queries - Ferhatosmanoglu, Agrawal, Abbadi (2001) Self-citation (Ferhatosmanoglu) (Correct)
....buckets retrieved by the same query may change according to the underlying partitioning technique. The partitioning technique must be developed such that the expected number of retrieved buckets is minimized. In the literature, techniques have been optimized for only range and similarity queries [4, 18, 15] and not for conical queries. A popular partitioning approach for traditional queries is the regular grid file [29, 26] ffl Disk Arm Movement: Data transfer capacities are improving rapidly, while disk arm speed which is limited by the physical movement of the arm, is improving relatively ....
O. Egecioglu and H. Ferhatosmanoglu. Circular data-space partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, pages 194--200, November 1999.
Approximate Nearest Neighbor Searching in Multimedia.. - Ferhatosmanoglu.. (2000) (8 citations) Self-citation (Ferhatosmanoglu) (Correct)
.... data set for indexing including kdb trees [37] hB tree [31] R tree [23] R tree [5] SS tree [43] TV tree [28] X tree [8] Pyramid Technique [7] Hybrid Tree [12] There are also techniques that are proposed to reduce the size of the retrieved set in multiple disk architectures [16, 19, 20]. All these index structures focus mainly on finding the exact result for a query. Therefore, a retrieved set of size s includes the query result set and some irrelevant objects. The optimal set of objects to be retrieved is the result set, i.e. no objects are retrieved if they are not in the ....
O. Egecioglu and H. Ferhatosmanoglu. Circular data-space partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, pages 194--200, November 1999. 18
Approximate Nearest Neighbor Searching in Multimedia.. - Ferhatosmanoglu.. (2001) (8 citations) Self-citation (Ferhatosmanoglu) (Correct)
.... data set for indexing including kdb trees [35] hB tree [29] R tree [22] R tree [5] SS tree [41] TV tree [26] X tree [8] Pyramid Technique [7] Hybrid Tree [12] There are also techniques that are proposed to reduce the size of the retrieved set in multiple disk architectures [15, 18, 19]. All these index structures focus mainly on finding the exact result for a query. Therefore, a retrieved set of size s includes the query result set and some irrelevant objects. The optimal set of objects to be retrieved is the result set, i.e. no objects are retrieved if they are not in the ....
O. Egecioglu and H. Ferhatosmanoglu. Circular data-space partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, pages 194--200, November 1999. 16
Clustering Declustered Data for Efficient Retrieval - Ferhatosmanoglu, Agrawal.. (1999) Self-citation (Ferhatosmanoglu) (Correct)
....a very important factor for fast parallel searching is the number of buckets retrieved by the queries. Reaching optimality in the rst two factors may not lead to fast searching if this third factor is not minimized. It is important to reduce the expected number of partitions retrieved by queries [8]. It has been shown that hyperpyramid based partitioning reduces this number e ectively for range queries [11, 4] In the hyperpyramid partitioning technique, the data space is rst divided into 2d major hyperpyramids, each has the center point as its apex, as shown in Figure 3. Then, p=2d ....
O. Egecioglu and H. Ferhatosmanoglu. Circular dataspace partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, November 1999. To appear.
Optimal Partitioning for Spatial Data - Divyakant (Correct)
No context found.
O. Egecioglu and H. Ferhatosmanoglu. Circular data-space partitioning for similarity queries and parallel disk allocation. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems, pages 194--200, November 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC