A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Optimized Index Structures for Querying RDF from the Web
LA-WEB '05 Proceedings of the Third Latin American Web Congress
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
ACM Transactions on Computational Logic (TOCL)
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
ISWC '09 Proceedings of the 8th International Semantic Web Conference
SUMMA: subgraph matching in massive graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Benchmarking database representations of RDF/S stores
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
RDFBroker: a signature-based high-performance RDF store
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
NOVA: a novel and efficient framework for finding subgraph isomorphism mappings in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Hi-index | 0.00 |
STUN is an extension of social networks in which the edges are characterized by spatio-temporal annotations, as well as uncertainty allowing us to express not only relationships between vertices, but when and where these relationships were true, and how certain we are that the relationships hold. We propose a STUN query language that consists of sub graphs with spatio-temporal constraints and uncertainty requirements. We then develop an index structure to store STUN graphs, together with an algorithm to answer such queries. We describe experiments with a real-world YouTube social network data set and show that our algorithm performs well on graphs with over a million edges.