Sale!

# Algorithms  Assignment3

\$25.00

Category:

## Description

Algorithms
Assignment3
1

IMDB Movie Database and Query Generator
In this assignment, you are going to design and develop movie database and a query generator
for IMDB movie data. You are given a .csv file which stores the following information for each
movie. There are around 5000 movies listed in the file.
• id
• Color
• movie_title
• genres
• duration
• director_name
• actor_1_name
• actor_2_name
• actor_3_name
• plot_keywords
• language
• country
• content_rating
• title_year
• imdb_score
Functional and Design Requirements
– creates a movie database by reading the data from .csv file into an array
– allows to add as many fields possible as search index
o each time a new field index is added to the database, a new red black tree is
created by the given field as the key. For example, db.addFieldIndex(“title”) will
create a new red black tree by title field. Then, key is the title, and the value is
the set of id’s of movies having the same title.
– stores red black trees in a hash table
– allows to create a query by combining one or more of the following queries.
o and
CS 401 Algorithms May 15, 2019
Assignment3
2
o or
o not
o greater than or equal to
o less than or equal to
o equal to
o not equal to
– Executes the query using the indexing trees
– Prints the information of all the movies that are in the result set
A sample test case is provided below. The program prints the movie information for all records
with year= 2013 and imdb_scores=6.1.
package database;
public class MoviesDB<T extends Comparable<T {
private String fileName;
private Map<String, RedBlackTree<T, HashSet<Integer indexTreeMap
= new HashMap<String, RedBlackTree<T, HashSet<Integer();
private Movie[] db;
private int n;
//load the array with the data given in the csv file
public MoviesDB(String fileName) throws FileNotFoundException{

}
//create a new red black tree by field
}
//returns the hash map for index trees (red black trees)
public Map<String, RedBlackTree<T, HashSet<Integer getIndexTreeMap(){
return indexTreeMap;
}
//sample text case
public static void main(String[] args) throws FileNotFoundException {
MoviesDB movieDB = new MoviesDB(“simple.csv”);
Query<Integer query=new And(new Equal(“year”,2012),new Equal(“imdb_score”,6.1));
HashSet<Integer result = (HashSet<Integer) query.execute(movieDB.getIndexTreeMap());
if(result!=null)
System.out.println(result);
Iterator<Integer idIterator = result.iterator();
while(idIterator.hasNext()) {
int id = idIterator.next();
movieDB.print(id);
}
}
}
//simple.csv
1,Color,Avatar ,178,James Cameron,CCH Pounder,Joel David Moore,Wes Studi,http://www.imdb.com/title/tt0499549/?ref_=fn_tt_tt_1,English,USA,PG-13,2009,7.9
2,Color,Pirates of the Caribbean: At World’s End ,169,Gore Verbinski,Johnny Depp,Orlando Bloom,Jack Davenport,http://www.imdb.com/title/tt0449088/?ref_=fn_tt_tt_1,English,USA,PG-13,2007,7.1
3,Color,Spectre ,148,Sam Mendes,Christoph Waltz,Rory Kinnear,Stephanie Sigman,http://www.imdb.com/title/tt2379713/?ref_=fn_tt_tt_1,English,UK,PG-13,2012,6.8
4,Color,John Carter ,132,Andrew Stanton,Daryl Sabara,Samantha Morton,Polly Walker,http://www.imdb.com/title/tt0401729/?ref_=fn_tt_tt_1,English,USA,PG-13,2012,6.6
5,Color,Spider-Man 3 ,156,Sam Raimi,J.K. Simmons,James Franco,Kirsten Dunst,http://www.imdb.com/title/tt0413300/?ref_=fn_tt_tt_1,English,USA,PG-13,2012,6.1
6,Color,Tangled ,100,Nathan Greno,Brad Garrett,Donna Murphy,M.C. Gainey,http://www.imdb.com/title/tt0398286/?ref_=fn_tt_tt_1,English,USA,PG,2010,7.8
7,Color,Avengers: Age of Ultron ,141,Joss Whedon,Chris Hemsworth,Robert Downey Jr.,Scarlett Johansson,http://www.imdb.com/title/tt2395427/?ref_=fn_tt_tt_1,English,USA,PG-13,2015,7.5
8,Color,Harry Potter and the Half-Blood Prince ,153,David Yates,Alan Rickman,Daniel Radcliffe,Rupert Grint,http://www.imdb.com/title/tt0417741/?ref_=fn_tt_tt_1,English,UK,PG,2009,7.5
9,Color,Batman v Superman: Dawn of Justice ,183,Zack Snyder,Henry Cavill,Lauren Cohan,Alan D. Purwin,http://www.imdb.com/title/tt2975590/?ref_=fn_tt_tt_1,English,USA,PG-13,2016,6.9
10,Color,Superman Returns ,169,Bryan Singer,Kevin Spacey,Marlon Brando,Frank Langella,http://www.imdb.com/title/tt0348150/?ref_=fn_tt_tt_1,English,USA,PG-13,2012,6.1
CS 401 Algorithms May 15, 2019
Assignment3
3
Sample Output:
[5, 10]
—————————–
id:5
color:Color
color:Color
title:Spider-Man 3
duration:156
director_name:Sam Raimi
act1:J.K. Simmons
act2:James Franco
act3:Kirsten Dunst
language:English
country:USA
content_rating:PG-13
title_year:2012
imdb_score:6.1
—————————–
—————————–
id:10
color:Color
color:Color
title:Superman Returns
duration:169
director_name:Bryan Singer
act1:Kevin Spacey
act2:Marlon Brando
act3:Frank Langella
language:English
country:USA
content_rating:PG-13
title_year:2012
imdb_score:6.1
—————————–
CS 401 Algorithms May 15, 2019
Assignment3
4
Examples for more queries:
Query<Integer query=new Not(new Equal(“color”,”Color”));
Query<Integer query=new And(new LT(“imdb_score”,7.0), new GT(“imdb_score”,6.0));
Query<Integer query=new And(new Or(new Equal(“year”,2013),new GTE(“imdb_score”,6.0)),
new NotEqual(“language”, “English”));
HINT: You can use “Composite” design pattern to build composite query structure. Please find a
sample project at:
https://nick79.gitlab.io/mnblog/post/composite_design_pattern/
How Submit:
You are supposed to submit your work as a single zip file via CANVAS. Zip file including all source files
you created. Please use the following file format while naming the zip file:
LastNameFirstnameX_Y.zip where LastNameFirstname is your last name with the first letter in capital,
followed by your first name with the first letter in capital; the X is the course code; the Y is the
assignment #. (ex: SerceFatmaCS401_3.zip)