Distributed Indexes

Rohit Khare (eugene.leitl@lrz.uni-muenchen.de)
Tue, 07 Dec 1999 21:31:31 +0530

From: Abhas Abhinav <abhas@linuxfreak.com>

Hello everyone,

I want to make a distributed tree-based index on a small beowulf
cluster. The aim is to make searching in parallel a possibility. My
questions are: Can I, somehow, make use of a Linked Allocation scheme
(via some sort of shared memory) or will I have to resort to using array
based tree structures? Tree will not be a binary tree... But an "n-ary"
tree. I am, at present, using PVM 3.4 for message passing and process
control. I have not found any mention of these sort of structures either
in the PVM documentation or among the lots of papers I have downloaded
over time... However, the PVMSync library does mention linked lists, no
further pointers, examples or discussion are provided. I would be
grateful if anyone could provide me with information (web links, papers,
code etc.) in this regard.

BTW, I am a final year undergrad student of Computer Science and Engg.
at an engg. college here in India.

Abhas Abhinav.
Regional Engineering College,
Durgapur, West Bengal.
To unsubscribe send a message body containing "unsubscribe"
to beowulf-request@beowulf.org