Sciweavers

2635 search results - page 55 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 3 months ago
Topology Search over Biological Databases
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
Lin Guo, Jayavel Shanmugasundaram, Golan Yona
127
Voted
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 6 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
116
Voted
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 8 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
146
Voted
ISPD
2007
ACM
151views Hardware» more  ISPD 2007»
15 years 4 months ago
Pattern sensitive placement for manufacturability
When VLSI technology scales toward 45nm, the lithography wavelength stays at 193nm. This large gap results in strong refractive effects in lithography. Consequently, it is a huge...
Shiyan Hu, Jiang Hu
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen