University : | Others UniLearnO is not sponsored or endorsed by this college or university. |
---|---|
Big Data Assessment Task
This is an individual coding assignment. The objective is to implement the R-tree. Each submission will be graded based on correctness. The rest of the document explains the details.
How Your Submission Will Be Tested:
You will be given a dataset
id 1 x 1 y 1
id 2 x 2 y 2
id n x n y n
Speci?cally, the ?rst line gives the number of points in the dataset. Then, every subsequent line gives a point’s id, x-, and y-coordinates. Your program should build an R-tree in memory from the dataset.
[Range Query]:
x 1 x’ 1 y 1 y’ 1
x 2 x’ 2 y 2 y’ 2
x 100 x’ 100 y 100 y’ 100
You should output to a disk ?le:
That is, each line speci?es a query whose rectangle is [ x, x ′ y, y ′
Secondly, display the
number
of points returned by each query-note: we need only
the number of points retrieved
, instead of the details of those points.
Firstly, your program should display the time sequential-scan benchmark
Thirdly, display the
total running time
of answering all the 100 queries, and the
average time
of each query (i.e., divide the total running time by 100)
.
This Big Data Assessment has been solved by our Big Data experts at UniLearnO. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.
Eureka! You've stumped our genius minds (for now)! This exciting new question has our experts buzzing with curiosity. We can't wait to craft a fresh solution just for you!