Sciweavers

926 search results - page 102 / 186
» Parallel Databases
Sort
View
CLUSTER
2006
IEEE
14 years 4 months ago
MSSG: A Framework for Massive-Scale Semantic Graphs
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
Timothy D. R. Hartley, Ümit V. Çataly&...
ICDAR
2003
IEEE
14 years 3 months ago
A Model-based Line Detection Algorithm in Documents
In this paper we present a novel model based approach to detect severely broken parallel lines in noisy textual documents. It is important to detect and remove these lines so the ...
Yefeng Zheng, Huiping Li, David S. Doermann
PODS
2004
ACM
128views Database» more  PODS 2004»
14 years 10 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
CDES
2008
123views Hardware» more  CDES 2008»
13 years 11 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
ECEASST
2006
305views more  ECEASST 2006»
13 years 10 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...