Sciweavers

320 search results - page 1 / 64
» A New Compression Method with Fast Searching on Large Databa...
Sort
View
VLDB
1987
ACM
66views Database» more  VLDB 1987»
13 years 8 months ago
A New Compression Method with Fast Searching on Large Databases
In this paper, a new compression method for constant removal from very large scientific and statistical databases is presented. The new method combines the best features from seve...
Jianzhong Li, Doron Rotem, Harry K. T. Wong
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 9 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 5 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
13 years 11 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...