Comparison Queries for Uncertain Graphs
نویسندگان
چکیده
Extending graph models to incorporate uncertainty is important for many applications, including disease transmission networks, where edges may have a disease transmission probability associated with them, and social networks, where nodes may have an existence probability associated with them. Analysts need tools that support analysis and comparision of these uncertain graphs. To this end, we have developed a prototype SQL-like graph query language with emphasis on operators for uncertain graph comparison. In order to facilitate adding new operators and to enable developers to use existing operators as building blocks for more complex ones, we have implemented a query engine with an extensible system architecture. The utility of our query language and operators in analyzing uncertain graph data is illustrated using two real world data sets: a dolphin observation network and a citation network. Our approach serves as an example for developing simple query languages that enables users to write their own ad-hoc uncertain graph comparison queries without extensive programming knowledge.
منابع مشابه
On Uncertain Graphs Modeling and Queries
Large-scale, highly-interconnected networks pervade both our society and the natural world around us. Uncertainty, on the other hand, is inherent in the underlying data due to a variety of reasons, such as noisy measurements, lack of precise information needs, inference and prediction models, or explicit manipulation, e.g., for privacy purposes. Therefore, uncertain, or probabilistic, graphs ar...
متن کاملTowards Querying Uncertain Graphs
Large-scale, highly-interconnected networks pervade both our society and the natural world around us. Uncertainty, on the other hand, is inherent in the underlying data due to a variety of reasons, such as noisy measurements, lack of precise information needs, inference and prediction models, or explicit manipulation, e.g., for privacy purposes. Therefore, uncertain, or probabilistic, graphs ar...
متن کاملEfficient Subgraph Search over Large Uncertain Graphs
Retrieving graphs containing a query graph from a large graph database is a key task in many graph-based applications, including chemical compounds discovery, protein complex prediction, and structural pattern recognition. However, graph data handled by these applications is often noisy, incomplete, and inaccurate because of the way the data is produced. In this paper,we study subgraph queries ...
متن کاملUncertain Temporal Knowledge Graphs
Temporal data can be found in various sources from patient histories, purchase histories, employee histories, to web logs. Recent advances in open information extraction have paved the way for automatic construction of knowledge graphs (kgs) from such sources. Often the extraction tools used to construct kgs produce facts and rules along with their confidence scores, leading to the notion of un...
متن کاملk-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of similarity search in standard graphs, a fundamental problem for probabilistic graphs is to efficiently answer k-nearest neighbor queries (k-NN), which is the problem of computing the k closest nodes to some specific node....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013