#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1987

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

In the era of global-scale services, big data analytical queries are often required to process datasets that span multiple data centers (DCs). In this setting, cross-DC bandwidth is often the scarcest, most volatile, and/or most expensive resource. However, current widely deployed big data analytics frameworks make no attempt to minimize the traffic… (More)

- Margarida Mamede
- ISCIS
- 2005

We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Chávez and Navarro. Experimental results show that, with respect to range queries, it outperforms the original data structure when the database dimension is below 12. Moreover, the… (More)

- Margarida Mamede, Francisco A.R. Barbosa
- 2007 22nd international symposium on computer and…
- 2007

We evaluate the performance of range queries in the Recursive List of Clusters (RLC) metric data structure, when the metric spaces are natural language dictionaries with the Levenshtein distance. The study compares RLC with five data structures (GNAT, H-Dsatl, LAESA, LC, and vp-trees) and comprises six dictionaries. The natural language dictionaries (in… (More)

- João Dinis, Margarida Mamede
- ISVD
- 2011

- Margarida Mamede, Luís Monteiro
- EPIA
- 1993

- Aida Vitória, Margarida Mamede
- Description Logics
- 1999

- Margarida Mamede, Luís Monteiro
- JICSLP
- 1992

This paper presents a novel scheme for constraint logic programming, based on an abstract model of constraints that takes as primitive the notions of atomic constraint and substitution. It is shown that the constraint model generalizes the constraint languages of Höhfeld and Smolka [8], and fits well in the general framework proposed by Saraswat [17]. The… (More)

- Margarida Mamede
- 1995

In this paper, the query-answering problem (also called retrieval problem, in terminological logics) is studied and a new framework is proposed. The declarative semantics extends the classical definition of answer in order to refer to some elements that exist in all models although they may not possess a name. With an appropriate representation of these… (More)

- Margarida Mamede, Luís Monteiro
- EPIA
- 1991

We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is based on Fortune’s plane sweep algorithm. The crucial idea is to use the wavefront for solving the nearest neighbour queries as the Voronoi diagram is being computed, instead of storing it in an auxiliary data structure, as the… (More)