18 search results - page 2 / 4 » Partially Persistent Search Trees with Transcript Operations |
ASPLOS
2011
ACM
12 years 9 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
ICDE
2004
IEEE
14 years 7 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
SWAT
1992
Springer
13 years 9 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
CP
2007
Springer
13 years 12 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
ISMIS
2000
Springer
13 years 9 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...