Sciweavers

685 search results - page 47 / 137
» Comparing Object-Oriented Database Systems Benchmark Methods
Sort
View
VLDB
2007
ACM
105views Database» more  VLDB 2007»
15 years 4 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
74
Voted
JUCS
2002
120views more  JUCS 2002»
14 years 10 months ago
Instance Cooperative Memory to Improve Query Expansion in Information Retrieval Systems
The main goal of this research is to improve Information Retrieval Systems by enabling them to generate search outcomes that are relevant and customized to each specific user. Our ...
Lobna Jeribi, Béatrice Rumpler
CAP
2010
14 years 5 months ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce
100
Voted
CATE
2004
190views Education» more  CATE 2004»
14 years 11 months ago
Enhancing Online Learning Performance: An Application of Data Mining Methods
Recently web-based educational systems collect vast amounts of data on user patterns, and data mining methods can be applied to these databases to discover interesting associations...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
92
Voted
PDPTA
2000
14 years 11 months ago
Performance Analysis of a Cluster File System
Design of cluster file system is very important for building a general-purpose cluster with commodity components. To provide scalable high I/O performance needed in the scientific...
Cong Du, Zhiwei Xu