Sciweavers

1284 search results - page 215 / 257
» Data Structures for Mergeable Trees
Sort
View
DOLAP
2000
ACM
15 years 2 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
DEXA
2009
Springer
127views Database» more  DEXA 2009»
15 years 4 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
ICFP
2005
ACM
15 years 10 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
INFOCOM
2007
IEEE
15 years 4 months ago
Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks
— Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to imp...
Xiaojing Xiang, Zehua Zhou, Xin Wang
FOCS
2000
IEEE
15 years 2 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount