8 citations found. Retrieving documents...
D. Zhang, V. J. Tsotras, and D. Gunopulos. Efficient aggregation over objects with extent. In Proc. of 21th ACM International SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems (PODS), Madison, Wisconsin, USA, pages 121--132, June 2002. 8

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Collaborative Frame Selection: Exact and Distributed.. - Song, van der..   (Correct)

.... there are many different ways of guiding search direction and step size, most of these methods are based on derivatives [Nash and Sofer, 1996] The camera frame selection problem can be viewed as a special case of the general box aggregation problem over spatial objects in database research [Zhang et al. 2002]. The spatial objects could be point objects, intervals, or rectangular objects. Aggregation over point objects is a special case of orthogonal range searching in computational geometry. Agarwal and Erickson [Agarwal and Erickson, 1999] provide a review of geometric range searching and its related ....

....version of balanced tree, to speed up range searching in high dimensional space. Work has been reported on aggregation over point objects [Chan and Ioannidis, 1999, Geffner et al. 2000, Ho et al. 1997] and 1D intervals [Yang and Widom, 2001, Zhang et al. 2001] Zhang, Tsotras, and Gunopulos [Zhang, 2002, Zhang et al. 2002] extend the research to rectangular spatial objects, usually referred to as aggregation over spatial objects with extents . Such aggregation is not limited to constant weights but also to the more general case where the weight is a polynomial function of the intersection area ....

[Article contains additional citation context not shown here]

Zhang, D., Tsotras, V. J., and Gunopulos, D. (2002). Efficient aggregation over objects with extent. In Proc. of 21th ACM International SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Madison, Wisconsin, USA, pages 121--132. 12


Aggregation Computation over Complex Objects - Zhang (2002)   (2 citations)  Self-citation (Zhang Tsotras Gunopulos)   (Correct)

....existence of aggregate indices with a single time granularity and we build a general framework of how to extend these structures to the fixed storage model and the fixed time window model. Examples of such single granularity indices are the SB tree [YW01] the MVSB tree [ZMT 01] and the BA tree [ZTG02]. As shown in section 6.3.1, to aggregate objects with 1 dimensional extent (each object has a time interval) we can utilize two SB trees, each of which maintains a set of point objects (one for the interval start time and the other for the interval end time) and is able to answer the following ....

....solutions are based on the range tree proposed by [Ben80] A variation of the range tree which is used to solve the d dimensional dominance sum query is called the ECDF tree [Ben80] 2 n) time. Note that the ECDFtree is a static and internal memory structure. For the disk based, dynamic case, [ZTG02] proposed two versions of the ECDF B tree. ZTG02] also presented the BA tree which combines the benefits of the two ECDF B trees. Time Granularity. A glossary of time granularity concepts appears in [BDE 98] BJW00] deeply investigates the formal characterization of time granularities. Bet01] ....

[Article contains additional citation context not shown here]

D. Zhang, V. J. Tsotras and D. Gunopulos, "Efficient Aggregation over Objects with Extent", Proc. of PODS, 2002.


An Exact Algorithm Optimizing Coverage-Resolution for .. - Song, van der..   (Correct)

No context found.

D. Zhang, V. J. Tsotras, and D. Gunopulos. Efficient aggregation over objects with extent. In Proc. of 21th ACM International SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems (PODS), Madison, Wisconsin, USA, pages 121--132, June 2002. 8


Best-k Queries on Database Systems - Tao Tao Chengxiang   (Correct)

No context found.

D. Zhang, V. J. Tsotras, and D. Gunopulos. Efficient aggregation over objects with extent. In PODS, 2002. 10


Approximate Temporal Aggregation - Tao, Papadias, Faloutsos (2004)   (1 citation)  (Correct)

No context found.

Zhang, D., Tsotras, V., Gunopulos, D. Efficient Aggregation over Objects with Extent. PODS, 2002.


Spatio-Temporal Aggregation Using Sketches - Tao, Kollios, Considine, Li.. (2004)   (2 citations)  (Correct)

No context found.

Zhang, D., Tsotras, V., Gunopulos, D. Efficient Aggregation over Objects with Extent PODS, 2002.


An Exact Algorithm Optimizing Coverage-Resolution for .. - Song, van der..   (Correct)

No context found.

D. Zhang, V. J. Tsotras, and D. Gunopulos. Efficient aggregation over objects with extent. In Proc. of 21th ACM International SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems (PODS), Madison, Wisconsin, USA, pages 121--132, June 2002. 8


Spatiotemporal Aggregate Computation: A Survey - Lopez, Snodgrass, Moon (2004)   (Correct)

No context found.

Donghui Zhang, Vassilis J. Tsotras, and Dimitrios Gunopulos. Efficient Aggregation Over Objects with Extent. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 121--132, Madison, WI, June 2002. 28

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