Sciweavers

527 search results - page 27 / 106
» Processing search queries in a distributed environment
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 10 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
CN
2007
148views more  CN 2007»
13 years 9 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
ICDE
2005
IEEE
123views Database» more  ICDE 2005»
14 years 10 months ago
High-Availability Algorithms for Distributed Stream Processing
Stream-processing systems are designed to support an emerging class of applications that require sophisticated and timely processing of high-volume data streams, often originating...
Alex Rasin, Jeong-Hyon Hwang, Magdalena Balazinska...
CIKM
2009
Springer
14 years 3 months ago
Location cache for web queries
This paper proposes a strategy to reduce the amount of hardware involved in the solution of search engine queries. It proposes using a secondary compact cache that keeps minimal i...
Mauricio Marín, Flavio Ferrarotti, Marcelo ...
COLCOM
2005
IEEE
14 years 2 months ago
Matching distributed systems to their environment using dissipative structures
In contrast to a large body of theoretical work on computer systems, distributed systems are not idealised constructions, unconstrained by physical world limitations. They must be...
Jim Dowling, Dominik Dahlem, Jan Sacha