Sciweavers

3131 search results - page 183 / 627
» Generalized connection caching
Sort
View
111
Voted
ICDT
2003
ACM
91views Database» more  ICDT 2003»
15 years 6 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
100
Voted
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 5 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
91
Voted
POPL
1996
ACM
15 years 5 months ago
Discovering Auxiliary Information for Incremental Computation
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...
Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum
134
Voted
EXPCS
2007
15 years 4 months ago
Context switch overheads for Linux on ARM platforms
Context switching imposes a performance penalty on threads in a multitasking environment. The source of this penalty is both direct overhead due to running the context switch code...
Francis M. David, Jeffrey C. Carlyle, Roy H. Campb...
CAV
2006
Springer
105views Hardware» more  CAV 2006»
15 years 4 months ago
FAST Extended Release
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
Sébastien Bardin, Jérôme Lerou...