Sciweavers

2985 search results - page 106 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
EDBTW
2006
Springer
15 years 8 months ago
A Data and Query Model for Streaming Geospatial Image Data
Abstract. Most of the recent work on adaptive processing and continuous querying of data streams assume that data objects come in the form of tuples, thus relying on the relational...
Michael Gertz, Quinn Hart, Carlos Rueda, Shefali S...
MOBIDE
2005
ACM
15 years 10 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
IPPS
1999
IEEE
15 years 9 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
HPDC
2005
IEEE
15 years 10 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...
SEBD
1996
94views Database» more  SEBD 1996»
15 years 6 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer