Sciweavers

796 search results - page 78 / 160
» A Formalization of ODMG Queries
Sort
View
108
Voted
DBPL
1993
Springer
104views Database» more  DBPL 1993»
15 years 5 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
15 years 5 months ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...
85
Voted
KBS
2007
74views more  KBS 2007»
15 years 21 days 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
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 1 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
180
Voted
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 1 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts