Concept

Index inversé

Publications associées (7)

Practical Private Range Search in Depth

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on “pr ...

2018

Practical Private Range Search Revisited

Odysseas Papapetrou, Ioannis Demertzis

2016

MEM0R1ES: Memory-based Information Systems

Michele Catasta

The advent of the Web reshaped the way in which humans memorize information, arguably unlike any other technological advance of the last decades. Rather than remembering the information itself, people are primed to find the needed information through Web s ...

EPFL2015

Query-driven indexing in large-scale distributed systems

Gleb Skobeltsyn

Efficient and effective search in large-scale data repositories requires complex indexing solutions deployed on a large number of servers. Web search engines such as Google and Yahoo! already rely upon complex systems to be able to return relevant query re ...

EPFL2009

Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Gleb Skobeltsyn

In this paper, we present a query-driven indexing/retrieval strategy for efficient full text retrieval from large document collections distributed within a structured P2P network. Our indexing strategy is based on two important properties: (1) the generate ...

2009

Scalable peer-to-peer Web search using highly discriminative keys

Vinh Toan Luu

Standard general-purpose Web retrieval relies on centralized search engines that do not realistically scale when applied to the exponentially growing number of documents available on the Web. By taking advantage of the resource sharing principle, Peer-to-P ...

EPFL2007

Indexing data-oriented overlay networks

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt

We address the problem of how a data-oriented, structured overlay networks can be constructed efficiently from scratch in a self-organized way, a problem that has so far not been addressed in the literature. This problem occurs when using overlay networks ...

2005

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search