304 search results - page 15 / 61 » Parallel and Distributed Compressed Indexes |
CLUSTER
2005
IEEE
14 years 2 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
IPPS
1998
IEEE
14 years 21 days ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
PPOPP
2003
ACM
14 years 1 months ago
2003
ACM
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
SCCC
1998
IEEE
14 years 21 days ago
1998
IEEE
We present a scalable algorithm for the parallel computation of inverted files for large text collections. The algorithm takes into account an environment of a high bandwidth netw...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...