4541 search results - page 508 / 909 » Cache-Oblivious Algorithms and Data Structures |
168
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
179
click to vote
SBBD
2004
15 years 7 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
163
click to vote
VMCAI
2004
Springer
15 years 12 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
181
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
185
click to vote
DEBU
2010
15 years 3 months ago
2010
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...