1960 search results - page 260 / 392 » The Logic of Large Enough |
LOPSTR
1998
Springer
14 years 2 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
MICRO
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper we investigate the behavior of data prefetching on an access decoupled machine and a superscalar machine. We assess if there are bene ts to using the decoupling para...
SIGMOD
1997
ACM
14 years 2 months ago
1997
ACM
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
CCL
1994
Springer
14 years 2 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
ICDE
1992
IEEE
14 years 2 months ago
1992
IEEE
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...