Sciweavers

2728 search results - page 150 / 546
» The EGTV Query Language
Sort
View
POPL
2007
ACM
16 years 5 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
DBPL
1997
Springer
94views Database» more  DBPL 1997»
15 years 9 months ago
Querying Multidimensional Databases
Abstract. Multidimensional databases are large collections of data, often historical, used for sophisticated analysis oriented to decision making. This activity is supported by an ...
Luca Cabibbo, Riccardo Torlone
COCO
2006
Springer
75views Algorithms» more  COCO 2006»
15 years 8 months ago
Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
Albert Atserias
WWW
2007
ACM
16 years 5 months ago
How NAGA uncoils: searching with entities and relations
Current keyword-oriented search engines for the World Wide Web do not allow specifying the semantics of queries. We address this limitation with NAGA1 , a new semantic search engi...
Gjergji Kasneci, Fabian M. Suchanek, Maya Ramanath...
PLDI
2012
ACM
13 years 7 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...