Sciweavers

735 search results - page 124 / 147
» Query Optimization In Compressed Database Systems
Sort
View
DBSEC
2006
131views Database» more  DBSEC 2006»
13 years 9 months ago
Interactive Analysis of Attack Graphs Using Relational Queries
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
Lingyu Wang, Chao Yao, Anoop Singhal, Sushil Jajod...
SIAMIS
2011
13 years 2 months ago
Large Scale Bayesian Inference and Experimental Design for Sparse Linear Models
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
Matthias W. Seeger, Hannes Nickisch
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
SOSP
2009
ACM
14 years 4 months ago
Modular data storage with Anvil
Databases have achieved orders-of-magnitude performance improvements by changing the layout of stored data – for instance, by arranging data in columns or compressing it before ...
Mike Mammarella, Shant Hovsepian, Eddie Kohler
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 28 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen