Concept

Linked data structure

Related publications (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Optimistic Concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...

ACM Press2016

Growing a Graph Matching from a Handful of Seeds

Matthias Grossglauser, Seyed Hamed Hassani, Ehsan Kazemi

In many graph–mining problems, two networks from different domains have to be matched. In the absence of reliable node attributes, graph matching has to rely on only the link structures of the two networks, which amounts to a generalization of the classic ...

Assoc Computing Machinery2015

NoDB: Efficient Query Execution on Raw Data Files

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Ioannis Alagiannis, Renata Borovica-Gajic

As data collections become larger and larger, users are faced with increasing bottlenecks in their data analysis. More data means more time to prepare and to load the data into the database before executing the desired queries. Many applications already av ...

Assoc Computing Machinery2015

Adaptive Query Processing on Raw Data Files

Ioannis Alagiannis

Nowadays, business and scientific applications accumulate data at an increasing pace. This growth of information has already started to outgrow the capabilities of database management systems (DBMS). In a typical DBMS usage scenario, the user should define ...

EPFL2015

A database system maintains a feature set of a modern database system while operating directly on raw data files. Systems may use an adaptive indexing mechanism that maintains positional information to provide efficient access to raw data files, a flexible ...

2014

The Venice Time Machine project aims at building a multidimensional model of Venice and its evolution covering a period of more than 1000 years. Kilometers of archives are currently being digitized, transcribed and indexed setting the base of the largest d ...

2013

The goal of this paper is to study the learning abilities of adaptive networks in the context of cognitive radio networks and to investigate how well they assist in allocating power and communications resources in the frequency domain. The allocation mecha ...

Institute of Electrical and Electronics Engineers, Inc., 345 E. 47 th St. NY NY 10017-2394 United States2013

Reactive Programming Abstractions for Complex Event Logic and Dynamic Data Dependencies

Ingo Maier

A large part of software written today is reactive. In contrast to batch mode systems, a reactive program continuously adapts itself to new input which often requires a substantial amount of engineering. Traditionally, reactive programs are implemented in ...

EPFL2013

NoDB: Efficient Query Execution on Raw Data Files

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Ioannis Alagiannis

As data collections become larger and larger, data loading evolves to a major bottleneck. Many applications already avoid using database systems, e.g., scientific data analysis and social networks, due to the complexity and the increased data-to-query time ...

2012

, ,

Transactional memory is an appealing paradigm for concurrent programming. Many software implementations of the paradigm were proposed in the last decades for both shared memory multi-core systems and clusters of distributed machines. However, chip manufact ...

2012