Sciweavers

6456 search results - page 977 / 1292
» Constraint Solving on Terms
Sort
View
VLDB
2008
ACM
196views Database» more  VLDB 2008»
16 years 7 months ago
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
Thomas Rölleke, Hengzhi Wu, Jun Wang, Hany Azzam
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
16 years 6 months ago
Skippy: a new snapshot indexing method for time travel in the storage manager
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived p...
Ross Shaull, Liuba Shrira, Hao Xu
SIGMOD
2001
ACM
135views Database» more  SIGMOD 2001»
16 years 6 months ago
The Network is the Database: Data Management for Highly Distributed Systems
This paper describes the methodology and implementation of a data management system for highly distributed systems, which was built to solve the scalability and reliability proble...
Julio C. Navas, Michael J. Wynblatt
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
162
Voted
PPOPP
2010
ACM
16 years 4 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg