344 search results - page 7 / 69 » Adaptive indexing for relational keys |
SYRCODIS
2007
13 years 11 months ago
2007
As XML has become a standard for data representation, it is inevitable to propose and implement techniques for efficient managing of XML data. A natural alternative is to exploit...
FSE
2008
Springer
13 years 11 months ago
2008
Springer
Consider the permutation S in RC4. Roos pointed out in 1995 that after the Key Scheduling Algorithm (KSA) of RC4, each of the initial bytes of the permutation, i.e., S[y] for smal...
DATESO
2004
13 years 11 months ago
2004
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
LOGCOM
2002
13 years 9 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
TABLEAUX
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...