11212 search results - page 690 / 2243 » Semi-persistent Data Structures |
234
click to vote
ICALP
1994
Springer
15 years 11 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
204
Voted
VLDB
1989
ACM
15 years 11 months ago
1989
ACM
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
212
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
211
click to vote
CAISE
1995
Springer
15 years 10 months ago
1995
Springer
, methods, techniques and tools. High level languages, structured programming, abstract data types, formal methods, non-procedural programming, object orientation, CASE, support en...
143
click to vote
BTW
2009
Springer
15 years 10 months ago
2009
Springer
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...