Sciweavers

2635 search results - page 209 / 527
» Algorithms for the Database Layout Problem
Sort
View
SIGMOD
2010
ACM
174views Database» more  SIGMOD 2010»
15 years 11 months ago
Sampling dirty data for matching attributes
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
Henning Köhler, Xiaofang Zhou, Shazia Wasim S...
IJCAI
2007
15 years 8 months ago
Change of Representation for Statistical Relational Learning
Statistical relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. We previously introduced view learnin...
Jesse Davis, Irene M. Ong, Jan Struyf, Elizabeth S...
ECEASST
2006
305views more  ECEASST 2006»
15 years 6 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 10 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 6 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik