Sciweavers

11394 search results - page 603 / 2279
» Error-Correcting Data Structures
Sort
View
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
16 years 1 months ago
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
Roberto Uribe Paredes, Gonzalo Navarro
SOFSEM
2004
Springer
16 years 17 days ago
Tree Signatures and Unordered XML Pattern Matching
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
EKAW
1999
Springer
15 years 11 months ago
Acquiring Expert Knowledge for the Design of Conceptual Information Systems
Abstract. Conceptual Information Systems unfold the conceptual structure of data stored in relational databases. In the design phase of the system, conceptual hierarchies have to b...
Gerd Stumme
DEXAW
1997
IEEE
125views Database» more  DEXAW 1997»
15 years 11 months ago
Can we Rely on SQL?
It is important for any data language that it enables many people to derive correct information from a databases in a simple, effective way with predictable performance. In an ana...
J. H. ter Bekke
FPCA
1993
15 years 11 months ago
Parallel Implementation of Bags
Multisets (also called bags) are an interesting data structure for parallelly implemented functional programming languages, since they do not force an unneeded restriction of the ...
Herbert Kuchen, Katia Gladitz