Object-Relational Database Representations for Text Indexing

Details Object-Relational Database Representations for Text Indexing Object-Relational Database Representations for Text Indexing

2009-06-17

arxiv.org/abs/0906.3112v1

Computer Science

Information Retrieval

Scientific paper

One of the distinctive features of Information Retrieval systems comparing to Database Management systems, is that they offer better compression for posting lists, resulting in better I/O performance and thus faster query evaluation. In this paper, we introduce database representations of the index that reduce the size (and thus the disk I/Os) of the posting lists. This is not achieved by redesigning the DBMS, but by exploiting the non 1NF features that existing Object-Relational DBM systems (ORDBMS) already offer. Specifically, four different database representations are described and detailed experimental results for one million pages are reported. Three of these representations are one order of magnitude more space efficient and faster (in query evaluation) than the plain relational representation.

Affiliated with

Also associated with

No associations

Rating

Object-Relational Database Representations for Text Indexing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Object-Relational Database Representations for Text Indexing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Object-Relational Database Representations for Text Indexing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222688