Sciweavers

69 search results - page 10 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
WWW
2008
ACM
14 years 8 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
WWW
2009
ACM
14 years 8 months ago
Dataplorer: a scalable search engine for the data web
More and more structured information in the form of semantic data is nowadays available. It offers a wide range of new possibilities especially for semantic search and Web data in...
Haofen Wang, Qiaoling Liu, Gui-Rong Xue, Yong Yu, ...
WWW
2005
ACM
14 years 8 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
ADC
2004
Springer
116views Database» more  ADC 2004»
14 years 27 days ago
Index Compression Using Fixed Binary Codewords
Document retrieval and web search engines index large quantities of text. The static costs associated with storing the index can be traded against dynamic costs associated with us...
Vo Ngoc Anh, Alistair Moffat