Sciweavers

484 search results - page 7 / 97
» Large graph processing in the cloud
Sort
View
CIKM
2009
Springer
15 years 1 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
ICCV
2007
IEEE
15 years 11 months ago
Geometric Integrability and Consistency of 3D Point Clouds
Numerous applications processing 3D point data will gain from the ability to estimate reliably normals and differential geometric properties. Normal estimates are notoriously nois...
George Kamberov, Gerda Kamberova
CLOUDCOM
2010
Springer
14 years 7 months ago
Attaching Cloud Storage to a Campus Grid Using Parrot, Chirp, and Hadoop
The Hadoop filesystem is a large scale distributed filesystem used to manage and quickly process extremely large data sets. We want to utilize Hadoop to assist with dataintensive ...
Patrick Donnelly, Peter Bui, Douglas Thain
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 2 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 ...
85
Voted
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 1 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...