• Publications
  • Influence
Efficient Subgraph Matching on Billion Node Graphs
TLDR
We present a novel algorithm that supports efficient subgraph matching on billion-node graphs deployed on a distributed memory store using efficient graph exploration and massive parallel computing for query processing. Expand
  • 314
  • 37
  • PDF
Distributed Data Aggregation Scheduling in Wireless Sensor Networks
TLDR
A distributed algorithm to generate a collision-free schedule for data aggregation in wireless sensor networks is proposed based on maximal independent sets. Expand
  • 273
  • 28
  • PDF
Reasoning about Record Matching Rules
TLDR
We introduce a class of matching dependencies (MDs) for specifying the semantics of data in unreliable relations, defined in terms of similarity metrics and a dynamic semantics. Expand
  • 174
  • 26
  • PDF
Graph pattern matching
TLDR
We propose a revision of graph pattern matching, based on a class of graph patterns, in which an edge denotes the connectivity in a data graph within a predefined number of hops. Expand
  • 254
  • 25
  • PDF
Towards certain fixes with editing rules and master data
TLDR
We propose a method for finding certain fixes, based on master data, a notion of certain regions, and a class of editing rules. Expand
  • 163
  • 21
  • PDF
A stable gene selection in microarray data analysis
TLDR
We propose two novel gene selection methods based on the gene scoring functions s1(·) and s2(·), respectively, which are efficient, effective, and robust in identifying differentially expressed genes. Expand
  • 165
  • 17
Query preserving graph compression
TLDR
We propose query preserving graph compression, to compress graphs relative to a class Λ of queries of users' choice while preserving the answers to all the queries in Λ. Expand
  • 166
  • 15
  • PDF
Indexing multi-dimensional data in a cloud system
TLDR
We propose RT-CAN, a multi-dimensional indexing scheme in epiC to support efficient multi- dimensional query processing in a Cloud system. Expand
  • 181
  • 12
  • PDF
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
TLDR
This paper investigates frequent subgraph mining on uncertain graphs under probabilistic semantics and proposes an approximate mining algorithm. Expand
  • 113
  • 12
  • PDF
Composite event coverage in wireless sensor networks with heterogeneous sensors
TLDR
This paper investigates the composite event coverage problem with the purpose of optimizing coverage quality subject to the constraint of not exceeding the total budget. Expand
  • 69
  • 10
...
1
2
3
4
5
...