Sciweavers

1709 search results - page 179 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 6 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont
BMCBI
2006
127views more  BMCBI 2006»
15 years 6 months ago
A graph-search framework for associating gene identifiers with documents
Background: One step in the model organism database curation process is to find, for each article, the identifier of every gene discussed in the article. We consider a relaxation ...
William W. Cohen, Einat Minkov
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
15 years 4 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
BMCBI
2008
208views more  BMCBI 2008»
15 years 6 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
GIS
2005
ACM
16 years 7 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...