5 citations found. Retrieving documents...
M. Koubarakis and S. Skiadopoulos, Tractable query answering in indefinite constraint databases: Basic Results and applications to querying spatiotemporal information, SpatioTemporal Database Management, 204--223, 1999.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Indexing Moving Points - Agarwal, Arge, Erickson (2000)   (58 citations)  (Correct)

.... later extended to incorporate several important issues, including uncertainty in the motion and communication cost [46, 47, 48, 49, 50] Other spatio temporal models can be found in [13, 17, 18] Although a number of practical methods have been proposed for accessing and searching moving objects [19, 25, 26, 43, 48], they all require Omega Gamma n) I Os in the worst case, even if the query range is empty. Kollios et al. 23] proposed an efficient indexing scheme, based on partition trees [2, 3] for storing a set of points moving on the real line. It uses O(n) disk blocks, answers a 1 dimensional query of ....

M. Koubarakis and S. Skiadopoulos, Tractable query answering in indefinite constraint databases: Basic Results and applications to querying spatiotemporal information, SpatioTemporal Database Management, 204--223, 1999.


Time Responsive Indexing Schemes for Moving Points - Agarwal, Arge, Vahrenhold (2001)   (3 citations)  (Correct)

.... extended to incorporate several important issues, including uncertainty in the motion and communication cost [38, 34, 36, 37, 35] Other spatio temporal models can be found in [11, 16, 15] Although a number of practical methods have been proposed for accessing and searching moving objects (see [36, 30, 21, 26, 24] and the references therein) almost all of them require Omega Gamma N=B) I Os in the worst case even if the query output size is O(1) Kollios et al. 20] proposed the first provably efficient indexing scheme, based on partition trees [3, 4] for queries of type Q1. The structure uses O(N=B) ....

M. Koubarakis and S. Skiadopoulos. Tractable query answering in indefinite constraint databases: Basic results and applications to querying spatiotemporal information. In Proc. International Workshop on Spatio-Temporal Database Management, pages 204--223, 1999.


Indexing Moving Points - Agarwal, Arge, Erickson (2000)   (58 citations)  (Correct)

....extended in [40, 36, 38, 39, 37] to incorporate several important issues, including uncertainty in the motion and communication cost. Other spatio temporal models can be found in [11, 13, 14] Although a number of practical methods have been proposed for accessing and searching moving objects [38, 33, 20], they all require Omega Gamma n) I Os in the worst case even if the query output size is O(1) Kollios et al. 18] proposed an efficient indexing scheme, based on partition trees [1, 2] for storing a set of points moving on the real line. It uses O(n) disk blocks, answers a 1 dimensional ....

M. Koubarakis and S. Skiadopoulos, Tractable query answering in indefinite constraint databases: Basic Results and applications to querying spatiotemporal information, Spatio-Temporal Database Management, 204--223, 1999.


Indexing Moving Points - Agarwal, Arge, Erickson (2000)   (58 citations)  (Correct)

....extended in [37, 33, 35, 36, 34] to incorporate several important issues, including uncertainty in the motion and communication cost. Other spatio temporal models can be found in [10, 12, 13] Although a number of practical methods have been proposed for accessing and searching moving objects [35, 31, 30, 18, 19], they all require Omega Gamma n) I Os in the worst case even if the query output is O(1) Kollios et al. 16] proposed an efficient indexing scheme, based on partition trees [1, 2] for storing a set of points moving on the x axis with a fixed speed. It uses O(n) disk blocks, answers a ....

M. Koubarakis and S. Skiadopoulos, Tractable query answering in indefinite constraint databases: Basic Results and applications to querying spatiotemporal information, Spatio-Temporal Database Management, 1999, 204--223.


Tractable Disjunctions of Linear Constraints: Basic Results and .. - Koubarakis (1996)   (2 citations)  Self-citation (Koubarakis)   (Correct)

....of a set of (arbitrary) disjunctions of linear constraints. Previous work on this problem is reported in [2] ffl We will apply the main result of Section 3 to the problem of tractable query answering in indefinite linear constraint databases [21, 24] Preliminary results on this topic appear in [25, 26]. Acknowledgements The comments of the reviewers have greatly improved the presentation of this paper (one of them has in fact spotted a small problem with an earlier version of the algorithms VarElimination and GlobalConsistency ) ....

M. Koubarakis and S. Skiadopoulos. Tractable Query Answering in Indefinite Constraint Databases: Basic Results and Applications to Querying SpatioTemporal Information. In Spatio-Temporal Database Management (Proceedings of the International Workshop STDBM'99), volume 1678 of LNCS, pages 204-- 223. Springer, 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