Sciweavers

48 search results - page 4 / 10
» Quantifying and Querying Network Reachability
Sort
View
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
14 years 8 months ago
Recursive Computation of Regions and Connectivity in Networks
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
11 years 9 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...
SRDS
1999
IEEE
13 years 11 months ago
Information Dissemination in Partitionable Mobile Ad Hoc Networks
Ad-hoc wireless networks have no wired component, and may have unpredictable mobility pattern. Such networks can get partitioned and reconnected several times. One possible approa...
Goutham Karumanchi, Srinivasan Muralidharan, Ravi ...
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 1 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
WWW
2008
ACM
14 years 7 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng