Publications associées à Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval

Publications associées (27)

Robustness of gossip-based protocols

Through the decentralization of control and resources, distributed systems combine each participant's individual capabilities to achieve greater flexibility, scalability, and robustness compared to their centralized counterparts. The performance and consis ...

EPFL2024

From scattered sources to comprehensive technology landscape : A recommendation-based retrieval approach

Karl Aberer, Chi Thang Duong

Mapping the technology landscape is crucial for market actors to take informed investment decisions. However, given the large amount of data on the Web and its subsequent information overload, manually retrieving information is a seemingly ineffective and ...

ELSEVIER2023

Graph Embedding for Retrieval

Chi Thang Duong

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

EPFL2022

Knowledge-Aware Cross-Modal Text-Image Retrieval for Remote Sensing Images

Devis Tuia, Christel Marie Tartini-Chappuis, Li Mi, Siran Li

Image-based retrieval in large Earth observation archives is difficult, because one needs to navigate across thousands of candidate matches only with the proposition image as a guide. By using text as a query language, the retrieval system gains in usabili ...

2022

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

Verónica del Carmen Estrada Galiñanes

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation po ...

IEEE COMPUTER SOC2022

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Ralf Seifert, Anna Timonina-Farkas

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

2023

A large scale study of reader interactions with images on Wikipedia

Tiziano Piccardi

Wikipedia is the largest source of free encyclopedic knowledge and one of the most visited sites on the Web. To increase reader understanding of the article, Wikipedia editors add images within the text of the article's body. However, despite their widespr ...

SPRINGER2022

Scalable Multi-Query Execution using Reinforcement Learning

Anastasia Ailamaki, Panagiotis Sioulas

The growing demand for data-intensive decision support and the migration to multi-tenant infrastructures put databases under the stress of high analytical query load. The requirement for high throughput contradicts the traditional design of query-at-a-time ...

Association for Computing Machinery2021

Wikipedia Chemical Structure Explorer: substructure and similarity searching of molecules from Wikipedia

Luc Patiny, Michaël Giuseppe Zasso

Background: Wikipedia, the world's largest and most popular encyclopedia is an indispensable source of chemistry information. It contains among others also entries for over 15,000 chemicals including metabolites, drugs, agrochemicals and industrial chemica ...

Biomed Central Ltd2015

5e{x+y}: Searching over Mathematical Content in Digital Libraries

Karl Aberer

This paper presents 5ex+y, a system that is able to extract, index and query mathematical content expressed as mathematical expressions, complementing the CERN Document Server (CDS). We present the most important aspects of its design, our approach to mode ...

ACM2015

Runtime Prediction for Scale-Out Data Analytics

Adrian Daniel Popescu

Many analytics applications generate mixed workloads, i.e., workloads comprised of analytical tasks with different processing characteristics including data pre-processing, SQL, and iterative machine learning algorithms. Examples of such mixed workloads ca ...

EPFL2015

Timely and cost-efficient data exploration through adaptive tuning

Matthaios Alexandros Olma

Modern applications accumulate data at an exponentially increasing rate and traditional database systems struggle to keep up. Decision support systems used in industry, rely heavily on data analysis, and require real-time responses irrespective of data siz ...

EPFL2019

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Christoph Koch, Immanuel Trummer

Query plans offer diverse tradeoffs between conflicting cost metrics such as execution time, energy consumption, or execution fees in a multi-objective scenario. It is convenient for users to choose the desired cost tradeoff in an interactive process, dyna ...

2015

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

B-hist: Entity-centric search over personal web browsing history

Karl Aberer, Philippe Cudré-Mauroux, Michele Catasta, Jean-Eudes Marie Ranvier

Web Search is increasingly entity centric; as a large fraction of common queries target specific entities, search results get progressively augmented with semi-structured and multimedia information about those entities. However, search over personal web br ...

Elsevier2014

Practical Private Range Search in Depth

Odysseas Papapetrou

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

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

Rachid Guerraoui, Anne-Marie Kermarrec

The rapidly increasing amount of user-generated content in social tagging systems provides a huge source of information. Yet, performing effective search in these systems is very challenging, especially when we seek the most appropriate items that match a ...

Assoc Computing Machinery2014

Peer-to-Peer Overlay Networks: Structure, Routing and Maintenance

Wojciech Galuba, Sarunas Girdzijauskas

Springer2018

Efficient Indexing and Query Processing of Model-View Sensor Data in the Cloud

Karl Aberer, Tian Guo

As the number of sensors that pervade our lives increases (e.g., environmental sensors, phone sensors, etc.), the eﬃcient management of massive amount of sensor data is becoming increasingly important. The inﬁnite nature of sensor data poses a serious chal ...

2014

Monitoring distributed fragmented skylines

Odysseas Papapetrou

Distributed skyline computation is important for a wide range of domains, from distributed and web-based systems to ISP-network monitoring and distributed databases. The problem is particularly challenging in dynamic distributed settings, where the goal is ...

2018