Campus Event Calendar
Event Entry
What and Who
Efficiently Indexing Connections in Large XML Collections with HOPI
Dr. Ralf Schenkel
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 20 January 2005
13:00
-- Not specified --
45
016
Saarbrücken
Abstract
The HOPI index, a connection index for XML documents based on the concept
of a 2-hop cover,
provides space- and time-efficient reachability tests along the ancestor,
descendant, and link axes
to support path expressions with wildcards in XML search engines. The talk
presents an efficient
divide-and-conquer algorithm for building HOPI and shows how to augment
the index with distance
information.
of a 2-hop cover,
provides space- and time-efficient reachability tests along the ancestor,
descendant, and link axes
to support path expressions with wildcards in XML search engines. The talk
presents an efficient
divide-and-conquer algorithm for building HOPI and shows how to augment
the index with distance
information.
Contact
--email hidden
passcode not visible
logged in users only
Bahareh Kadkhodazadeh, 01/17/2005 09:53
Bahareh Kadkhodazadeh, 10/21/2004 12:48 -- Created document.
Bahareh Kadkhodazadeh, 10/21/2004 12:48 -- Created document.