It is cost-prohibitive to find matches Q (G) of a pattern query Q in a big graph G. We approach
this by fetching a small subgraph GQ of G such that Q (GQ)= Q (G). We show that many …

XML data broadcast is an efficient way to disseminate semistructured information in wireless
mobile environments. In this paper, we propose a novel two-tier index structure to facilitate …

VLDB 2001 Submission Style Guide for Word Page 1 Benefi Query Optimizer Supporting
Multiple Access Methods cien onto 10 King’s College Rd., M5S 3G4, Toronto, ON, Canada P …

ABSTRACT RDF is the common data model to publish structured data on the Web. RDF
data sets are given as subject-predicateobject triples and typically are represented as …

Indexing large XML databases is crucial for efficient evaluation of XML twig queries. In this
paper, we propose a feature-based indexing technique, called FIX, based on spectral graph …

Optimizing query processing is always a challenging task in the XML database community.
Current state-of-the-art approaches focus mainly on simple query. Yet, as the usage of XML …

XML and semi-structured data is usually modeled using graph structures. Structural
summaries, which have been proposed to speedup XML query processing have graph …

The performance of XML query processing in persistent XML databases crucially depends
on the chosen data access paths, and on the efficiency of the remaining query processing …

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 …

Increasing popularity of XML in recent years has generated much interest in query
processing over graph-structured data. To support efficient evaluation of path expressions …