Scalable dataspace construction

dc.contributor.authorShibwabo, Bernard K.
dc.contributor.authorWanyembi, Gregory N.
dc.contributor.authorAteya, Ismail L.
dc.contributor.authorOmwenga, Vincent O.
dc.date.accessioned2017-07-21T10:30:39Z
dc.date.available2017-07-21T10:30:39Z
dc.date.issued2017
dc.descriptionThe conference aimed at supporting and stimulating active productive research set to strengthen the technical foundations of engineers and scientists in the continent, through developing strong technical foundations and skills, leading to new small to medium enterprises within the African sub-continent. It also seeked to encourage the emergence of functionally skilled technocrats within the continent.en_US
dc.description.abstractThis paper proposes the design and implementation of scalable dataspaces based on efficient data structures. Dataspaces are often likely to exhibit a multidimensional structure due to the unpredictable neighbour relationship between participants coupled by the continuous exponential growth of data. Layered range trees are incorporated to the proposed solution as multidimensional binary trees which are used to perform d-dimensional orthogonal range indexing and searching. Furthermore, the solution is readily extensible to multiple dimensions, raising the possibility of volume searches and even extension to attribute space. We begin by a study of the important literature and dataspace designs. A scalable design and implementation is further presented. Finally, we conduct experimental evaluation to illustrate the finer performance of proposed techniques. The design of a scalable dataspace is important in order to bridge the gap resulting from the lack of coexistence of data entities in the spatial domain as a key milestone towards pay-as-you-go systems integrationen_US
dc.description.sponsorshipStrathmore University;nstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.identifier.citationShibwabo, B. K., Wanyembi, G. N., Ateya, I. L., & Omwenga, V. O. (2017). Scalable dataspace construction. In Pan African Conference on Science, Computing and Telecommunications (PACT). Nairobi: Strathmore University. Retrieved from https://su-plus.strathmore.eduen_US
dc.identifier.urihttp://hdl.handle.net/11071/5177
dc.language.isoenen_US
dc.publisherStrathmore Universityen_US
dc.subjectDataspacesen_US
dc.subjectMachine learningen_US
dc.subjectSystems integrationen_US
dc.subjectSpatial databasesen_US
dc.subjectRange Treesen_US
dc.subjectScalabilityen_US
dc.titleScalable dataspace constructionen_US
dc.typeConference Paperen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Scalable dataspace construction.pdf
Size:
724.1 KB
Format:
Adobe Portable Document Format
Description:
Full text
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: