This page features MathJax technology to render mathematical formulae. If you are using a screen reader, please visit MathPlayer to download the plugin for your browser. Please note that this is an Internet Explorer-only plugin at this time.

Web Intelligence and Big Data

Top Navigation Bar

Courses
Anonymous Student

About Us Careers People Contact Us

My Courses Profile Course Records Settings Course Preferences

Web Intelligence and Big Data
by Dr. Gautam Shroff

Search this course

Side Navigation Bar

Quick Questions15
Home
Video Lectures
Discussion Forums
Quizzes
Course Outline
References and Resources
About the Instructor

Help Center

Course Materials Errors
Technical Issues

Quiz GL1 (Graph Databases) Help Center

Learn more

The hard deadline for this quiz is Tue 19 Jan 2038 4:14 AM CET.

In accordance with the Coursera Honor Code, I (Anonymous Student) certify that the answers here are my own work. Thank you!

Question 1

What does RDF stand for?

Recursive Datalog Foundations

Remote Data Framework

Resource Description Framework

Reasoning over Data Flux

Question 2

In RDF, the data graph is represented as:

A set of nodes

A bag of nodes

A set of edges

A bag of edges

Question 3

Partitioning RDF graphs for parallel execution is hard because

Graphs are large

Graphs can continuously change

Parallel framework such as map-reduce is not designed for graphs

RDF graphs have labels on edges and nodes

Interconnected nature does not lend for effective partitioning

Question 4

In order to support SPARQL queries, which of the following graph algorithms are required?

Community detection over large graphs

Graph pattern matching queries

Steiner tree computation

Reachability queries

Shortest path queries

In accordance with the Coursera Honor Code, I (Anonymous Student) certify that the answers here are my own work. Thank you!

You cannot submit your work until you agree to the Honor Code. Thanks!

Confirm Navigation

Are you sure you want to leave this page?