Efficient processing of category-restricted queries for Web directories

Compression of inverted indexes for fast query evaluation

Scholer, F
Williams, H
Zobel, J
Yiannis, J

January 2002

Compression reduces both the size of indexes and the time needed to evaluate queries. In this paper,...

Efficient single-pass index construction for text databases

Heinz, S
Zobel, J

January 2003

Efficient construction of inverted indexes is essential to provision of search over large collection...

Mining query logs to optimize index partitioning in parallel web search engines

Claudio Lucchese
Salvatore Orl
Raffaele Perego
Fabrizio Silvestri

January 2007

Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the invert...

Efficient processing of category-restricted queries for web directories

Altingovde I.S.
Can F.
Ulusoy Ö.

January 2008

We show that a cluster-skipping inverted index (CS-IIS) is a practical and efficient file structure ...

Incremental cluster-based retrieval using compressed cluster-skipping inverted files

Altingovde I.S.
Demir, E.
Can F.
Ulusoy Ö.

January 2008

We propose a unique cluster-based retrieval (CBR) strategy using a new cluster-skipping inverted fil...

Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections

Nima Asadi
Jimmy Lin

August 2016

For text retrieval systems, the assumption that all data structures reside in main memory is increas...

Improving the Performance of Pipelined Query Processing with Skipping

Jonassen, Simon
Bratsberg, Svein Erik

January 2012

Web search engines need to provide high throughput and short query latency. Recent results show that...

Optimized Inverted List Assignment in Distributed Search Engine Architectures ∗

February 2008

We study efficient query processing in distributed web search engines with global index organization...

The Efficiency of Inverted Index and Cluster Searches

Voorhees, Ellen M.

May 1986

The processing time and disk space requirements of an inverted index and top-down cluster search ar...

Inverted index support for numeric search

Marcus Fontoura
Ronny Lempel
Runping Qi
Jason Zien

January 2007

Today’s search engines are increasingly required to broaden their capabilities beyond free-text sear...

Positional data organization and compression in web inverted indexes

Akritidis, L.
Bozanis, P.

January 2012

To sustain the tremendous workloads they suffer on a daily basis, Web search engines employ highly c...

Techniques for Inverted Index Compression

Pibiri G. E.
Venturini R.

January 2021

The data structure at the core of large-scale search engines is the inverted index, which is essenti...

Efficient Query Processing in Distributed Search Engines

Jonassen, Simon

January 2013

Web search engines have to deal with a rapidly increasing amount of information, high query loads an...

Efficiency and effectiveness of query processing in cluster-based retrieval

Fazli Can
İsmai̇l Sengör Altingövde

January 2015

Our research shows that for large databases, without considerable additional storage overhead, clust...

To index or not to index:|bTime-space trade-offs in search engines with positional ranking functions

González Cornejo, Senen Andrés

January 2014

Magíster en Ciencias, Mención ComputaciónWeb search has become an important part of day-to-day life....

Compression of inverted indexes for fast query evaluation

Scholer, F
Williams, H
Zobel, J
Yiannis, J

January 2002

Compression reduces both the size of indexes and the time needed to evaluate queries. In this paper,...

Efficient single-pass index construction for text databases

Heinz, S
Zobel, J

January 2003

Efficient construction of inverted indexes is essential to provision of search over large collection...

Mining query logs to optimize index partitioning in parallel web search engines

Claudio Lucchese
Salvatore Orl
Raffaele Perego
Fabrizio Silvestri

January 2007

Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the invert...

Efficient processing of category-restricted queries for web directories

Altingovde I.S.
Can F.
Ulusoy Ö.

January 2008

We show that a cluster-skipping inverted index (CS-IIS) is a practical and efficient file structure ...

Incremental cluster-based retrieval using compressed cluster-skipping inverted files

Altingovde I.S.
Demir, E.
Can F.
Ulusoy Ö.

January 2008

We propose a unique cluster-based retrieval (CBR) strategy using a new cluster-skipping inverted fil...

Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections

Nima Asadi
Jimmy Lin

August 2016

For text retrieval systems, the assumption that all data structures reside in main memory is increas...

Improving the Performance of Pipelined Query Processing with Skipping

Jonassen, Simon
Bratsberg, Svein Erik

January 2012

Web search engines need to provide high throughput and short query latency. Recent results show that...

Optimized Inverted List Assignment in Distributed Search Engine Architectures ∗

February 2008

We study efficient query processing in distributed web search engines with global index organization...

The Efficiency of Inverted Index and Cluster Searches

Voorhees, Ellen M.

May 1986

The processing time and disk space requirements of an inverted index and top-down cluster search ar...

Inverted index support for numeric search

Marcus Fontoura
Ronny Lempel
Runping Qi
Jason Zien

January 2007

Today’s search engines are increasingly required to broaden their capabilities beyond free-text sear...

Positional data organization and compression in web inverted indexes

Akritidis, L.
Bozanis, P.

January 2012

To sustain the tremendous workloads they suffer on a daily basis, Web search engines employ highly c...

Techniques for Inverted Index Compression

Pibiri G. E.
Venturini R.

January 2021

The data structure at the core of large-scale search engines is the inverted index, which is essenti...

Efficient Query Processing in Distributed Search Engines

Jonassen, Simon

January 2013

Web search engines have to deal with a rapidly increasing amount of information, high query loads an...

Efficiency and effectiveness of query processing in cluster-based retrieval

Fazli Can
İsmai̇l Sengör Altingövde

January 2015

Our research shows that for large databases, without considerable additional storage overhead, clust...

To index or not to index:|bTime-space trade-offs in search engines with positional ranking functions

González Cornejo, Senen Andrés

January 2014

Magíster en Ciencias, Mención ComputaciónWeb search has become an important part of day-to-day life....

Compression of inverted indexes for fast query evaluation

Scholer, F
Williams, H
Zobel, J
Yiannis, J

January 2002

Compression reduces both the size of indexes and the time needed to evaluate queries. In this paper,...

Efficient single-pass index construction for text databases

Heinz, S
Zobel, J

January 2003

Efficient construction of inverted indexes is essential to provision of search over large collection...

Mining query logs to optimize index partitioning in parallel web search engines

Claudio Lucchese
Salvatore Orl
Raffaele Perego
Fabrizio Silvestri

January 2007

Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the invert...

Efficient processing of category-restricted queries for Web directories

Abstract

Extracted data

Efficient processing of category-restricted queries for Web directories

Abstract

Extracted data

Related items

Related items