Sciweavers

48 search results - page 5 / 10
» Slicing Long-Running Queries
Sort
View
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 8 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
DMG
2005
Springer
14 years 2 months ago
Framework for Querying Distributed Objects Managed by a Grid Infrastructure
Queries over scientific data often imply expensive analyses of data requiring a lot of computational resources available in Grids. We are developing a customizable query processor...
Ruslan Fomkin, Tore Risch
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
14 years 23 days ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
PPOPP
1999
ACM
14 years 27 days ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
JOLLI
2010
94views more  JOLLI 2010»
13 years 7 months ago
Querying Linguistic Trees
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
Catherine Lai, Steven Bird