On the Selection of Optimal Index Configuration in OO Databases

An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing technique

Efficient and Equitable Airport Slot Allocation

This paper studies slot allocation at congested airports in Europe. First, I discuss the inefficiencies of the current regulation, introduced as part of the liberalisation process of the air transport market. Then, I consider three marked based methods which are suitable to achieve a more efficient allocation of slots to airlines: congestion pricing, auctions and secondary trading. These methods are examined in terms of their ability to improve efficiency and in terms of their implications on the distribution of slots’ scarcity rents. Special attention is drawn to complementarities between slots. Finally, I propose to auction slots periodically, allowing secondary trading well before the first auction takes place. By selling slots before the first auction incumbents can be partially compensated for the subsequent withdrawal of their slots.