Sciweavers

2635 search results - page 96 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
15 years 11 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...
121
Voted
ICPR
2006
IEEE
15 years 10 months ago
Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
Alaa El. Sagheer, Naoyuki Tsuruta, Rin-ichiro Tani...
EDBT
1994
ACM
149views Database» more  EDBT 1994»
15 years 8 months ago
On the Estimation of Join Result Sizes
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
Arun N. Swami, K. Bernhard Schiefer
ISMIS
2005
Springer
15 years 9 months ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
BMCBI
2006
129views more  BMCBI 2006»
15 years 4 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...