Sciweavers

1810 search results - page 234 / 362
» Networked Query Processing for Distributed Stream-Based Appl...
Sort
View
129
Voted
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 8 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
EURONGI
2006
Springer
15 years 6 months ago
The Challenges of Merging Two Similar Structured Overlays: A Tale of Two Networks
Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network ...
Anwitaman Datta, Karl Aberer
ICON
2007
IEEE
15 years 8 months ago
A Cache Architecture for Counting Bloom Filters
— Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., u...
Mahmood Ahmadi, Stephan Wong
BMCBI
2010
183views more  BMCBI 2010»
15 years 2 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
WWW
2005
ACM
16 years 3 months ago
Improving text collection selection with coverage and overlap statistics
In an environment of distributed text collections, the first step in the information retrieval process is to identify which of all available collections are more relevant to a giv...
Thomas Hernandez, Subbarao Kambhampati