Sciweavers

2662 search results - page 452 / 533
» Data Compression Support in Databases
Sort
View
P2PKM
2004
15 years 8 months ago
Merging G-Grid P2P Systems While Preserving Their Autonomy
Peer-to-Peer (P2P) systems share and manage huge amounts of data and resources distributed across a large number of machines. In pure P2P environments the control is totally decent...
Gianluca Moro, Gabriele Monti, Aris M. Ouksel
NAR
2007
95views more  NAR 2007»
15 years 6 months ago
VisANT 3.0: new modules for pathway visualization, editing, prediction and construction
With the integration of the KEGG and Predictome databases as well as two search engines for coexpressed genes/proteins using data sets obtained from the Stanford Microarray Databa...
Zhenjun Hu, David M. Ng, Takuji Yamada, Chunnuan C...
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
16 years 1 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
DPD
2006
141views more  DPD 2006»
15 years 6 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...