Sciweavers

12015 search results - page 2082 / 2403
» Interactive Algorithms 2005
Sort
View
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 6 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 6 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
PODS
2005
ACM
130views Database» more  PODS 2005»
16 years 6 months ago
Composition of mappings given by embedded dependencies
Composition of mappings between schemas is essential to support schema evolution, data exchange, data integration, and other data management tasks. In many applications, mappings ...
Alan Nash, Philip A. Bernstein, Sergey Melnik
174
Voted
PODS
2005
ACM
85views Database» more  PODS 2005»
16 years 6 months ago
Relative risk and odds ratio: a data mining perspective
We are often interested to test whether a given cause has a given effect. If we cannot specify the nature of the factors involved, such tests are called model-free studies. There ...
Haiquan Li, Jinyan Li, Limsoon Wong, Mengling Feng...
ICFP
2005
ACM
16 years 6 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
« Prev « First page 2082 / 2403 Last » Next »