Sciweavers

2463 search results - page 106 / 493
» Compressing Pattern Databases
Sort
View
WEBDB
2007
Springer
159views Database» more  WEBDB 2007»
14 years 4 months ago
A clustering-based sampling approach for refreshing search engine's database
Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
WIS
2004
14 years 4 days ago
Pruning Update Log Files in Intermittently Connected Databases
Modern databases allow mobile clients that subscribe to replicated data, to process the replica without requiring continuous connectivity, and to receive the updates while connecte...
Liton Chakraborty, Ajit Singh, Kshirasagar Naik
JGAA
2007
135views more  JGAA 2007»
13 years 10 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
KDD
1995
ACM
173views Data Mining» more  KDD 1995»
14 years 2 months ago
Knowledge Discovery in Textual Databases (KDT)
The information age is characterizedby a rapid growth in the amountof information availablein electronicmedia. Traditional data handling methods are not adequate to cope with this...
Ronen Feldman, Ido Dagan
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 11 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...