Sciweavers

3514 search results - page 385 / 703
» On Moving Object Queries
Sort
View
ESCIENCE
2007
IEEE
15 years 10 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
ICDT
1995
ACM
79views Database» more  ICDT 1995»
15 years 10 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
210
Voted
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 8 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
DASFAA
2010
IEEE
176views Database» more  DASFAA 2010»
15 years 7 months ago
Efficient Database-Driven Evaluation of Security Clearance for Federated Access Control of Dynamic XML Documents
Achieving data security over cooperating web services is becoming a reality, but existing XML access control architectures do not consider this federated service computing. In this...
Erwin Leonardi, Sourav S. Bhowmick, Mizuho Iwaihar...
ER
2010
Springer
129views Database» more  ER 2010»
15 years 5 months ago
Specifying Aggregation Functions in Multidimensional Models with OCL
Multidimensional models are at the core of data warehouse systems, since they allow decision makers to early define the relevant information and queries that are required to satis...
Jordi Cabot, Jose-Norberto Mazón, Jes&uacut...