Show simple item record

dc.contributor.authorGuo, Linen_US
dc.contributor.authorShanmugasundaram, Jayavelen_US
dc.contributor.authorBeyer, Kevinen_US
dc.contributor.authorShekita, Eugeneen_US
dc.date.accessioned2007-04-04T19:37:04Z
dc.date.available2007-04-04T19:37:04Z
dc.date.issued2004-07-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2004-1943en_US
dc.identifier.urihttps://hdl.handle.net/1813/5654
dc.description.abstractWe propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses {\em structured data values} to score (rank) the results of keyword search queries over text columns. Our main contribution is a new family of inverted list indices and associated query algorithms that can support SVR efficiently in update-intensive databases, where the structured data values (and hence the scores of documents) change frequently. Our experimental results on real and synthetic data sets using BerkeleyDB show that we can support SVR efficiently in relational databases.en_US
dc.format.extent533742 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleEfficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databasesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics