Sciweavers

513 search results - page 49 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
15 years 9 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 1 months ago
An extensible test framework for the Microsoft StreamInsight query processor
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications. StreamInsight adopts a deterministic stream model that leve...
Alex Raizman, Asvin Ananthanarayan, Anton Kirilov,...
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
15 years 3 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...
ICDE
1998
IEEE
142views Database» more  ICDE 1998»
15 years 11 months ago
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
Nick Koudas, Kenneth C. Sevcik