Sciweavers

419 search results - page 68 / 84
» Translation of Aggregate Programs to Normal Logic Programs
Sort
View
DLT
2006
13 years 9 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
PPOPP
2009
ACM
14 years 8 months ago
Effective performance measurement and analysis of multithreaded applications
Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore process...
Nathan R. Tallent, John M. Mellor-Crummey
VLDB
1991
ACM
135views Database» more  VLDB 1991»
13 years 11 months ago
A Framework for Automating Physical Database Design
We propose a two-pha.se algorithm for physical database design. In phase one the algorithm, for each logical query, losesrules to determine characteristics of a physical design (s...
Steve Rozen, Dennis Shasha
ICDE
1996
IEEE
120views Database» more  ICDE 1996»
14 years 9 months ago
Towards the Reverse Engineering of Denormalized Relational Databases
This paper describes a method to cope with denormalized relational schemas in a database reverse engineering process. We propose two main steps to irnprove the understanding of da...
Jean-Marc Petit, Farouk Toumani, Jean-Franç...
TKDE
2010
161views more  TKDE 2010»
13 years 2 months ago
A Deductive Spreadsheet System for End Users
We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-bas...
Marcelo Tallis, Robert M. Balzer