Fg-index: towards verification-free query processing on graph databases

J Cheng, Y Ke, W Ng, A Lu - Proceedings of the 2007 ACM SIGMOD …, 2007 - dl.acm.org
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 …

Efficiently querying large XML data repositories: A survey

G Gou, R Chirkova - IEEE Transactions on Knowledge and …, 2007 - ieeexplore.ieee.org
Extensible markup language (XML) is emerging as a de facto standard for information
exchange among various applications on the World Wide Web. There has been a growing …

Indexing dataspaces

X Dong, A Halevy - proceedings of the 2007 ACM SIGMOD international …, 2007 - dl.acm.org
Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-
integration systems that also offer uniform access to heterogeneous data sources …

[PDF][PDF] Towards graph containment search and indexing

C Chen, X Yan, PS Yu, J Han, DQ Zhang… - Proceedings of the 33rd …, 2007 - csd.uoc.gr
Given a set of model graphs D and a query graph q, containment search aims to find all
model graphs g∈ D such that q contains g (q⊇ g). Due to the wide adoption of graph …

Out-of-core coherent closed quasi-clique mining from large dense graph databases

Z Zeng, J Wang, L Zhou, G Karypis - ACM Transactions on Database …, 2007 - dl.acm.org
Due to the ability of graphs to represent more generic and more complicated relationships
among different objects, graph mining has played a significant role in data mining, attracting …

[PDF][PDF] Structured materialized views for XML queries

A Arion, V Benzaken, I Manolescu… - Proceedings of the 33rd …, 2007 - vldb.org
The performance of XML database queries can be greatly enhanced by rewriting them using
materialized views. We study the problem of rewriting a query using materialized views …

Answering XML queries by means of data summaries

E Baralis, P Garza, E Quintarelli, L Tanca - ACM Transactions on …, 2007 - dl.acm.org
XML is a rather verbose representation of semistructured data, which may require huge
amounts of storage space. We propose a summarized representation of XML data, based on …

Extending a tuple-based XPath algebra to enhance evaluation flexibility

C Mathis - Informatik-Forschung und Entwicklung, 2007 - Springer
Over the recent years, very little effort has been made to give XPath a proper algebraic
treatment. One laudable exception is the Natix Algebra (NAL) which defines the translation …

[PDF][PDF] Structural query optimization in native XML databases: a hybrid approach

SC Haw, CS Lee - Journal of Applied Sciences, 2007 - researchgate.net
As XML (eXtensible Mark-up Language) is gaining its popularity in data exchange over the
Web, querying XML data has become an important issue to be addressed. In native XML …

Efficient processing of XPath queries using indexes

S Madria, Y Chen, K Passi, S Bhowmick - Information Systems, 2007 - Elsevier
A number of indexing techniques have been proposed in recent times for optimizing the
queries on XML and other semi-structured data models. Most of the semi-structured models …