3 RELATED WORK
There have been innovative steps in Smart City devel-
opment over the past few years. It became essential to
develop a platform that will aggregate all the available
(related) information and will orchestrate it in the best
way as possible, towards meeting the defined goals.
3.1 Smart Campus
There is an even growing literature for Smart Cam-
puses which are related to data integration and
real-time processing of massive heterogeneous data
sources. An application prototype using semantic
technologies is discussed in (Boran et al., 2011). The
idea behind this approach is to include semantic in-
formation using ontologies with OWL and SPARQL.
Another approach (Valkanas and Gunopulos, 2013)
deals with event detection from real-time data using
heterogeneous sources.That experiment shows that
information extracted form social networks and sen-
sor data can be used for identifying events and they
show how affected users (that are physically close to
the event source) will be notified based on their actual
geolocation.
The high majority of related literature approaches
Smart Campuses from an Internet of Things (IoT)
point of view, having a focus on the physical cam-
pus infrastructure including sensor networks built into
buildings, physical entities and places (e.g., parking).
This is promising from the energy efficiency point of
view but basically provides the same challenges as
Smart City projects do. As we were looking for a
bit different kind of challenges, we decided to turn
to the social factors more than infrastructural. Be-
sides finding the need for integration of data coming
from sensor networks very important we think that
non-infrastructural aspects should play an equally im-
portant role in a life of a Campus. Therefore, people
living, studying and working on the Campus should
heavily be involved so we feel that exploitation of the
crowd’s power has a crucial effect on the success of
any Smart Campus-related projects.
3.2 Crowdsourcing
The term crowdsourcing is not easy to define. It is
a hybrid of “crowd” and “outsourcing”, meaning that
a given task is assigned to a number of people work-
ing on it explicitly. This approach is too restricting,
as it is coined in (Doan et al., 2011), therefore they
give the following definition: “a system is a crowd-
sourcing (CS) system if it enlists a crowd of humans
to help solve a problem defined by the system owners,
and if in doing so, it addresses the following four fun-
damental challenges: How to recruit and retain users?
What contributions can users make? How to combine
user contributions to solve the target problem? How
to evaluate users and their contributions?”
Starting from these challenges, (Doan et al., 2011)
also gives a classification of CS systems. Nine di-
mensions are identified but here we only concentrate
on those that are relevant for us. Based on the nature
of collaboration, CS systems can be either explicit or
implicit. Both are important for us as explicit systems
include evaluating (rate courses, meals, etc.), sharing
(location info, files, etc.) and networking (adding new
friends or classmates) while implicit systems might
be either standalone (when event prediction is based
on the history of users’ activities) or piggyback (for
example, based on the trajectories of a user’s move-
ment, predictions can be made). In the context of
Smart Campus applications, for the first fundamental
challenge (recruiting users) only voluntary participa-
tion is possible. For more classes of CS systems with
detailed explanations, see (Doan et al., 2011).
3.3 Graph Databases
Graph databases are gaining popularity in the past few
years as they provide adjacency structures for data
elements without having any indices (i.e., data ele-
ments contain direct pointers showing their adjacent
elements). The three basic building blocks of graph
databases are nodes (representing entities), proper-
ties (pertinent information related to nodes) and edges
(connecting nodes to nodes using directed arcs). Ac-
cording to the Property Graph Model (Robinson et al.,
2013, p. 4), nodes contain properties that are key—
value pairs, and edges (a.k.a. relationships) can also
have properties. This organization of data allows
them to be processed using the well-known graph al-
gorithms.
3.3.1 Advantages of Graph Databases
According to (Robinson et al., 2013), graph databases
offer three key advantages:
Performance. Graph databases are easy to scale
since queries are localized to a portion of the
graph only therefore query execution time is pro-
portional only to the size of the affected sub-graph
rather than the size of the overall graph.
Flexibility. Graphs are “naturally additive, meaning
we can add new kinds of relationships, new nodes,
and new subgraphs to an existing structure with-
out disturbing existing queries and application
ExtensibleDataManagementArchitectureforSmartCampusApplications-ACrowdsourcingbasedSolution
229