Sciweavers

2859 search results - page 452 / 572
» Querying Complex Structured Databases
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
KBS
2007
74views more  KBS 2007»
13 years 8 months ago
Representation and processing of information related to real world events
Event based analysis plays an important role in reducing the latency of information delivery in an event driven world. Also, the perception of an ‘event’ by a user is at a hig...
Aparna Nagargadde, V. Sridhar, Krithi Ramamritham
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 8 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 11 months ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno
CGF
2000
110views more  CGF 2000»
13 years 8 months ago
Directional Discretized Occluders for Accelerated Occlusion Culling
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
Fausto Bernardini, James T. Klosowski, Jihad El-Sa...