Sciweavers

11212 search results - page 371 / 2243
» Semi-persistent Data Structures
Sort
View
KDD
1995
ACM
193views Data Mining» more  KDD 1995»
15 years 10 months ago
Analyzing the Benefits of Domain Knowledge in Substructure Discovery
Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working wit...
Surnjani Djoko, Diane J. Cook, Lawrence B. Holder
CIMCA
2008
IEEE
15 years 8 months ago
RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
Amir Jahangard Rafsanjani, Seyed-Hassan Mirian-Hos...
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 6 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
MST
2006
97views more  MST 2006»
15 years 6 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Dynamic Range Reporting in External Memory
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
Yakov Nekrich