Sciweavers

32545 search results - page 282 / 6509
» Data Structures and Algorithms
Sort
View
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 8 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
IJCAI
2003
15 years 5 months ago
Inductive Learning in Less Than One Sequential Data Scan
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
Wei Fan, Haixun Wang, Philip S. Yu, Shaw-hwa Lo
TCAD
2008
124views more  TCAD 2008»
15 years 4 months ago
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
Neil Kettle, Andy King
128
Voted
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 7 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
ICDE
2006
IEEE
428views Database» more  ICDE 2006»
16 years 5 months ago
Integrating Unstructured Data into Relational Databases
In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extracti...
Imran R. Mansuri, Sunita Sarawagi