Sciweavers

332 search results - page 24 / 67
» Space Complexity vs. Query Complexity
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
14 years 4 months ago
Granularity Conscious Modeling for Probabilistic Databases
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially – and often inacc...
Eirinaios Michelakis, Daisy Zhe Wang, Minos N. Gar...
EDBT
2010
ACM
202views Database» more  EDBT 2010»
14 years 4 months ago
Querying trajectories using flexible patterns
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work ...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
ISEMANTICS
2010
13 years 8 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
ICDE
2000
IEEE
113views Database» more  ICDE 2000»
14 years 2 months ago
Web Query Optimizer
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
Vladimir Zadorozhny, Laura Bright, Louiqa Raschid,...