| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Porazdeljena baza pomenskih grafov
Authors:Bezget, Jan (Author)
Ojsteršek, Milan (Mentor) More about this mentor... New window
Files:.pdf MAG_Bezget_Jan_2012.pdf (2,93 MB)
 
Language:Slovenian
Work type:Master's thesis/paper (mb22)
Typology:2.09 - Master's Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V pričujočem delu predstavimo porazdeljeno bazo za hrambo pomenskih grafov in metodo aproksimativnega iskanja poti med vozlišči tega grafa. Iskanje poti je sestavni del mnogih metod za računanje pomenske podobnosti med pojmi. Najprej opišemo osnove pomenskega spleta in nekatere projekte ter tehnologije. Nato opišemo naš porazdeljen sistem, ki hrani pomenske grafe, uporabljeno tehnologijo in operacije, ki jih izvaja. Opišemo način razdelitve grafa na več računalnikov, kot tudi predstavimo način, kako povezati ločene dele pomenskega grafa v celoto z uvedbo koncepta robnih vozlišč. Aproksimativno iskanje poti temelji na njih, saj se uporabijo za vmesna iskalna vozlišča. Sledi predstavitev rezultatov meritev zmogljivosti sistema. V sklepu podamo možne izboljšave porazdeljenega sistema in posameznih komponent.
Keywords:pomenski splet, pomenski slovar, pomenski graf, aproksimativno iskanje poti
Year of publishing:2012
Publisher:[J. Bezget]
Source:Maribor
UDC:004.6:004.777(043.2)
COBISS_ID:16587798 Link is opened in a new window
NUK URN:URN:SI:UM:DK:5KOHJWF5
Views:1174
Downloads:78
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:Distributed database of semantic graphs
Abstract:In this thesis we present a distributed database for storing semantic graphs and an approximate pathfinding method between nodes of the semantic graph. The pathfinding is an integral component of many methods used for calculation of semantic similarity between concepts. We start by describing the basics of semantic web and some related projects and technologies. This is followed by a detailed description of our distributed system which stores the semantic graphs, including the technologies it uses and operations it performs. We describe a method of partitioning the semantic graph over multiple computer systems and a way to connect separate parts of the semantic graph into a whole, by introducing a concept of boundary nodes. The approximate pathfinding is based on these boundary nodes, as they are used as intermediate search nodes. We also present the results of system performance measurements. Finally, we provide some ideas for improvement of our distributed system and its components.
Keywords:semantic web, semantic dictionary, semantic graph, approximative pathfinding


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica