Develop an implementation of Page that represents B-tree nodes as text files on web pages, for the purposes of indexing (building a concordance for) the web. Use a file of search terms. Take web pages to be indexed from standard input. To keep control, take a command-line parameter m, and set an upper limit of 10m internal nodes (check with your system administrator before running for large m). Use an mdigit number to name your internal nodes. For example, when m is 4, your nodes names might be BTreeNode0000, BTreeNode0001, BTreeNode0002, and so forth. Keep pairs of strings on pages. Add a close() operation to the API, to sort and write. To test your implementation, ook for yourself and your friends on your university’s website.
Develop an implementation of Page that represents B-tree nodes as
text files on web pages, for the purposes of indexing (building a concordance for) the
web. Use a file of search terms. Take web pages to be indexed from standard input. To
keep control, take a command-line parameter m, and set an upper limit of 10m internal
nodes (check with your system administrator before running for large m). Use an mdigit number to name your internal nodes. For example, when m is 4, your nodes names
might be BTreeNode0000, BTreeNode0001, BTreeNode0002, and so forth. Keep pairs
of strings on pages. Add a close() operation to the API, to sort and write. To test your
implementation, ook for yourself and your friends on your university’s website.
Step by step
Solved in 3 steps