Algorithmics and applications of tree and graph searching

D Shasha, JTL Wang, R Giugno - Proceedings of the twenty-first ACM …, 2002 - dl.acm.org
Modern search engines answer keyword-based queries extremely efficiently. The
impressive speed is due to clever inverted index structures, caching, a domain-independent …

Research issues in web data mining

SK Madria, SS Bhowmick, WK Ng, EP Lim - … and Knowledge Discovery …, 1999 - Springer
In this paper, we discuss mining with respect to web data referred here as web data mining.
In particular, our focus is on web data mining research in context of our web warehousing …

[KIRJA][B] Database management systems

R Ramakrishnan, J Gehrke, J Gehrke - 2003 - bcucluj.ro
Database Management Systems Page 1 Database Management Systems 7 ^ Raghu
Ramakrishnan Page 2 DATABASE MANAGEMENT SYSTEMS Raghu Ramakrishnan …

Dataguides: Enabling query formulation and optimization in semistructured databases

R Goldman, J Widom - 1997 - ilpubs.stanford.edu
In F7Times-ItalicF7S38semistructured databases there is no schema fixed in advance. To
provide the benefits of a schema in such environments, we introduce DataGuides: concise …

Semistructured data

P Buneman - Proceedings of the sixteenth ACM SIGACT-SIGMOD …, 1997 - dl.acm.org
In semistructured data, the information that is normally associated with a schema is
contained within the data, which is sometimes called “self-describing”. In some forms of …

Data virtualization across heterogeneous formats

AB Fokoue-Nkoutche, O Hassanzadeh… - US Patent …, 2020 - Google Patents
Various embodiments virtualize data across heterogeneous formats. In one embodiment, a
plurality of heterogeneous data sources is received as input. A local schema graph including …

The Lorel query language for semistructured data

S Abiteboul, D Quass, J McHugh, J Widom… - International journal on …, 1997 - Springer
Lorel language, designed for querying semistructured data. Semistructured data is
becoming more and more prevalent, eg, in structured documents such as HTML and when …

Index structures for path expressions

T Milo, D Suciu - International Conference on Database Theory, 1999 - Springer
In recent years there has been an increased interest in managing data that does not conform
to traditional data models, like the relational or object oriented model. The reasons for this …

Path sharing and predicate evaluation for high-performance XML filtering

Y Diao, M Altinel, MJ Franklin, H Zhang… - ACM Transactions on …, 2003 - dl.acm.org
XML filtering systems aim to provide fast, on-the-fly matching of XML-encoded data to large
numbers of query specifications containing constraints on both structure and content. It is …

Exploiting local similarity for indexing paths in graph-structured data

R Kaushik, P Shenoy, P Bohannon… - … Conference on Data …, 2002 - ieeexplore.ieee.org
XML and other semi-structured data may have partially specified or missing schema
information, motivating the use of a structural summary which can be automatically …