Sciweavers

2514 search results - page 128 / 503
» On the Computation of Approximations of Database Queries
Sort
View
GIS
2005
ACM
16 years 7 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
CCS
2008
ACM
15 years 8 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
GIS
2006
ACM
16 years 7 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 9 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
PODS
2009
ACM
170views Database» more  PODS 2009»
16 years 7 months ago
A general datalog-based framework for tractable query answering over ontologies
d Abstract) Andrea Cal`i2,1 , Georg Gottlob1,2 , and Thomas Lukasiewicz1, 1 Computing Laboratory, University of Oxford, UK firstname.lastname@comlab.ox.ac.uk 2 Oxford-Man Institute...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...