Sciweavers

470 search results - page 31 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 8 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
DBPL
1999
Springer
101views Database» more  DBPL 1999»
14 years 1 months ago
On the Power of Incremental Evaluation in SQL-Like Languages
We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) ...
Leonid Libkin, Limsoon Wong
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 2 months ago
Analyzing Plan Diagrams of Database Query Optimizers
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
Naveen Reddy, Jayant R. Haritsa
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
14 years 3 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree
SSDBM
2011
IEEE
239views Database» more  SSDBM 2011»
13 years 12 days ago
Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
Julio López, Colin Degraf, Tiziana DiMatteo...