1 / 4

Search and Access Strategies for Web Archives

Search and Access Strategies for Web Archives. Sangchul Song and Joseph JaJa Institute for Advanced Computer Science Studies Department of Electrical and Computer Engineering University of Maryland, College Park, Maryland, USA. Background.

scolin
Download Presentation

Search and Access Strategies for Web Archives

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Search and Access Strategies for Web Archives Sangchul Song and Joseph JaJa Institute for Advanced Computer Science Studies Department of Electrical and Computer Engineering University of Maryland, College Park, Maryland, USA Archiving 2009

  2. Background • Web archives present unique resources of complex, dynamic, and linked information at an unprecedented scale and covering large temporal contexts. • Fast and cost-effective search and access strategies for web archives are quite challenging, especially when search and browsing are conducted within a temporal context. • Our work: A prototype system that enables users to easily search and access web archives using high level queries. Archiving 2009

  3. Full-text Search a Web Archive(in a better way) Q1. Search web archives using a combination of terms and time spans. Our approach provides an intuitive interface, coupled with effective storage organization and indexing schemes. Q2. How to handle time-constrained search (“Sept 11” before 2001)? Our approach provides much higher efficiency than the typical “Search all first, then filter out” approach. We use a ranking function that is time dependent. Q3. How are the returned results grouped and ranked? We develop a ranking scheme that groups similar (either spatially or temporally) results together, and score each group separately. Archiving 2009

  4. Screenshots Archiving 2009

More Related