Publications

Publications by HASLab

2003

Towards peer-to-peer content indexing

Authors
Baquero, C; Lopes, N;

Publication
Operating Systems Review

Abstract
Distributed Hash Tables are the core technology on a significant share of system designs for Peer-to-Peer information sharing. Typically, a location mechanism is provided and object identifiers act as keys in the index of object locations. When introducing a search mechanism, when single words an used as keys, the key image cardinality will be driven by the word popularity and most of the present designs will be unable to load balance the index among the nodes. We present two contributions: A design that allows participating nodes to load balance the indexing of popular keys and avoid content hot-spots on single nodes; A distributed mechanism for probabilistic filtering of popular keys (with low search relevance) that paves the way for scalable full content indexing.

CloseRead Abstract

2003

Workshop on Language Descriptions, Tools and Applications, LDTA@ETAPS 2003, Warsaw, Poland, April 12-13, 2003

Authors
Bryant, BR; Saraiva, J;

Publication
LDTA@ETAPS

Abstract

2003

Preface

Authors
Bryant, BR; Saraiva, J;

Publication
Electr. Notes Theor. Comput. Sci.

Abstract

2003

Embedding Domain Specific Languages in the Attribute Grammar Formalism

Authors
Saraiva, J; Schneider, S;

Publication
36th Hawaii International Conference on System Sciences (HICSS-36 2003), CD-ROM / Abstracts Proceedings, January 6-9, 2003, Big Island, HI, USA

Abstract
This paper presents techniques for the design and implementation of domain specific languages. Our techniques are based on higher-order attribute grammars. Formal languages are specified in the classical attribute formalism and domain specific languages are embedded in the specification via higher-order attributes. We present a domain specific language for pretty-printing and we show how such language can be easily embedded in the specification of a powerful spreadsheet-like tool. From such specification an incremental implementation is automatically derived and the first results are presented. © 2003 IEEE.

CloseRead Abstract

2003

Preface

Authors
Bryant, B; Saraiva, J;

Publication
Electronic Notes in Theoretical Computer Science

Abstract

2003

Generating spreadsheet-like tools from strong attribute grammars

Authors
Saraiva, J; Swierstra, D;

Publication
GENERATIVE PROGRAMMING AND COMPONENT ENGINEERING, PROCEEDINGS

Abstract
This paper presents techniques for the formal specification and efficient incremental implementation of spreadsheet-like tools. The spreadsheets are specified by strong attribute grammars. In this style of attribute grammar programming every single inductive computation is expressed within the attribute grammar formalism. Well-known attribute grammar techniques are used to reason about such grammars. For example, ordered scheduling algorithms can be used to statically guarantee termination of the attribute grammars and to derive efficient implementations. A strong attribute grammar for a spreadsheet is defined and the first incremental results are presented.

CloseRead Abstract