1675 search results - page 95 / 335 » Implementing Data Cubes Efficiently |
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...
Presentation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
TASTIER is a research project on the new information-access paradigm called type-ahead search, in which systems find answers to a keyword query on-the-fly as users type in the quer...
JPDC
2006
13 years 10 months ago
2006
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...