Aref, W. G. and Samet, H. (1994). Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM), pages 347--354, Gaithersburg, MD. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Remote Thin-Client Access to Spatial Database Systems - Hanan Samet Frantisek (2002) Self-citation (Samet) (Correct)
No context found.
Aref, W. G. and Samet, H. (1994). Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM), pages 347--354, Gaithersburg, MD.
Remote Thin-Client Access to Spatial Database Systems - Hanan Samet Frantisek (2002) Self-citation (Samet) (Correct)
No context found.
Aref, W. G. and Samet, H. (1994). Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM), pages 347--354, Gaithersburg, MD.
Interfacing the SAND Spatial Browser with FedStats Data - Hanan Samet Frantissek (2001) Self-citation (Samet) (Correct)
No context found.
W.G. Aref and H. Samet. Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM), pages 347-- 354, Gaithersburg, MD, December 1994.
Interfacing the SAND Spatial Browser with FedStats Data - Samet, Brabec, Hjaltason (2001) Self-citation (Samet) (Correct)
....in just one or a few programs. The drawback is that in the case of queries on the basis of the values of other attributes, a facility will be retrieved as many times as the number of programs in which it participates. This is a classic problem in databases known as the duplicate problem [2, 3]. In our example, this drawback is alleviated by using the group by attributename mechanism, which retrieves all tuples having the same value of the attribute name attribute simultaneously. In our example, we can use the EPA ID attribute. Note that it is not advisable to use the name ....
W.G. Aref and H. Samet. Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM), pages 347-- 354, Gaithersburg, MD, December 1994.
Efficient Window Block Retrieval in Quadtree-Based Spatial.. - Aref, Samet (1996) Self-citation (Aref Samet) (Correct)
.... may in fact encounter some of the objects more than once (e.g. when a region or line object has been decomposed into several blocks each of which contains a part of the region or line object) In this case, this step would have to eliminate the duplicates which is not a simple matter (but see [2, 4]) The rationale for our variant is that we may wish to use these blocks (i.e. BU ) as input to a subsequent operation whose underlying representation is also a quadtree thereby facilitating the composition of several operations. Another way to characterize our variant is that it is somewhat like ....
W. G. Aref and H. Samet. Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management, pages 347--354, Gaithersburg, Maryland, December 1994. ACM Press.
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