Sciweavers

1170 search results - page 218 / 234
» How Fast Is Too Fast
Sort
View
111
Voted
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 5 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
SPAA
1997
ACM
15 years 5 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
103
Voted
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 5 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
VLDB
1994
ACM
126views Database» more  VLDB 1994»
15 years 4 months ago
Building a Laboratory Information System Around a C++-Based Object-Oriented DBMS
MapBase is a laboratory information system that has been supporting a high-throughput genome-mapping operation for the last three years. We chose to build MapBase around a C++-bas...
Nathan Goodman, Steve Rozen, Lincoln Stein
DLS
2007
150views Languages» more  DLS 2007»
15 years 4 months ago
RPython: a step towards reconciling dynamically and statically typed OO languages
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
Davide Ancona, Massimo Ancona, Antonio Cuni, Nicho...