Sciweavers

1404 search results - page 47 / 281
» Increasing Concurrency in Databases Using Program Analysis
Sort
View
FLAIRS
2006
15 years 1 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
107
Voted
SIGMOD
2010
ACM
157views Database» more  SIGMOD 2010»
15 years 20 days ago
Workload-aware storage layout for database systems
The performance of a database system depends strongly on the layout of database objects, such as indexes or tables, onto the underlying storage devices. A good layout will both ba...
Oguzhan Ozmen, Kenneth Salem, Jiri Schindler, Stev...
103
Voted
ECOOP
2010
Springer
15 years 5 months ago
Capabilities for Uniqueness and Borrowing
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
Philipp Haller, Martin Odersky
99
Voted
CSL
1998
Springer
15 years 4 months ago
Revision Programming = Logic Programming + Integrity Constraints
We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justi ed revision based on a revisi...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...
COORDINATION
2009
Springer
16 years 1 months ago
Exceptionally Safe Futures
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
Armand Navabi, Suresh Jagannathan