Show simple item record

dc.contributor.authorKoçberber, Seyiten_US
dc.contributor.authorCan, Fazlıen_US
dc.coverage.spatialSan Antonio, Texas, USA
dc.date.accessioned2016-02-08T12:03:05Z
dc.date.available2016-02-08T12:03:05Z
dc.date.issued1999-02-03en_US
dc.identifier.urihttp://hdl.handle.net/11693/27854
dc.descriptionDate of Conference: 28 February - 02 March, 1999
dc.descriptionConference name: SAC '99 Proceedings of the 1999 ACM symposium on Applied computing
dc.description.abstractA new indexing method, called Compressed Multi-Framed Signature File (C-MFSF), that uses a partial query evaluation strategy with compressed signature bit slices is presented. In C-MFSF, a signature file is divided into variable sized compressed vertical frames with different on-bit densities to optimize the response time. Experiments with a real database of 152,850 records show that a response time less than 150 milliseconds is possible. For multi-term queries C-MFSF obtains the query results with fewer disk accesses than the inverted files. The method requires no indexing vocabulary. These attributes have important implications; for example, web search engines process multi-term queries in very large databases with sizeable vocabularies.en_US
dc.language.isoEnglishen_US
dc.source.titleSAC '99 Proceedings of the 1999 ACM symposium on Applied computingen_US
dc.relation.isversionofhttp://doi.org/10.1145/298151.298253en_US
dc.subjectSignature filesen_US
dc.subjectInverted filesen_US
dc.subjectCompressionen_US
dc.titleCompressed multi-framed signature files: an index structure for fast information retrievalen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage221en_US
dc.citation.epage226en_US
dc.identifier.doi10.1145/298151.298253en_US
dc.publisherACMen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record