Sciweavers

43 search results - page 5 / 9
» Relaxed selection techniques for querying time-series graphs
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 6 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICDIM
2008
IEEE
14 years 3 months ago
Dynamic detection and administration of materialized views based on the Query Graph Model
Database Management Systems (DBMS) are complex software systems which are used in an increasing number of applications. To obtain the best performance for business relevant applic...
Andreas Lübcke, Ingolf Geist, Ronny Bubke
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 3 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
SEMWEB
2009
Springer
14 years 3 months ago
Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
Giovambattista Ianni, Thomas Krennwallner, Alessan...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 8 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han