Sciweavers

12 search results - page 1 / 3
» Fg-index: towards verification-free query processing on grap...
Sort
View
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 3 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 5 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 9 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 ...
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 6 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
CIKM
2009
Springer
13 years 8 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck