Publication Type

Conference Proceeding Article

Version

Postprint

Publication Date

6-2012

Abstract

Database-generated dynamic web pages (db-pages, in short), whose contents are created on the fly by web applications and databases, are now prominent in the web. However, many of them cannot be searched by existing search engines. Accordingly, we develop a novel search engine named Dash, which stands for Db-pAge SearcH, to support db-page search. Dash determines db-pages possibly generated by a target web application and its database through exploring the application code and the related database content and supports keyword search on those db-pages. In this paper, we present its system design and focus on the efficiency issue.

To minimize costs incurred for collecting, maintaining, indexing and searching a massive number of db-pages that possibly have overlapped contents, Dash derives and indexes db-page fragments in place of db-pages. Each db-page fragment carries a disjointed part of a db-page. To efficiently compute and index db-page fragments from huge datasets, Dash is equipped with MapReduce based algorithms for database crawling and db-page fragment indexing. Besides, Dash has a top-k search algorithm that can efficiently assemble db-page fragments into db-pages relevant to search keywords and returns the k most relevant ones. The performance of Dash is evaluated via extensive experimentation.

Discipline

Databases and Information Systems

Research Areas

Data Management and Analytics

Publication

2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS 2012): Macau, China, 18-21 June 2012: Proceedings

First Page

435

Last Page

444

ISBN

9781457702952

Identifier

10.1109/ICDCS.2012.53

Publisher

IEEE

City or Country

Piscataway, NJ

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://doi.ieeecomputersociety.org/10.1109/ICDCS.2012.53

Share

COinS