About: Designing Indexing Structure for Discovering Relationships in RDF Graphs     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Vyhledávání komplexních vztahů mezi entitami je jednou z možností jak využívat semantického webu. Tato práce pojednává o nových přístupech v implementaci Rho-operátorů v RDF dotayovacích strojích, které umožní komplexní vztahy vyhledávat. Základním kamenem takovéto implementace je vytvoření indexační struktury, která bude popisovat původní RDF graf. Tento index bude vztvořen ve dvou krocích. Prvně se RDF graf přetransformuje na les stromů a potom ke každému stromu se vztvoří jeho signatura. Kromě signatur jsou uloženy další informace o transformovaných problémových uzlech. (cs)
  • Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing Rho-operators into RDF querying engines which will enable discovering such relationships viable. The cornerstone of such implementation is creating an index which describes the original RDF graph. The index is created in two steps. Firstly, it transforms the RDF graph into forest of trees and then to each tree creates its extended signature. The signatures are accompanied by the additional information about transformed problematic nodes breaking the tree structure.
  • Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing Rho-operators into RDF querying engines which will enable discovering such relationships viable. The cornerstone of such implementation is creating an index which describes the original RDF graph. The index is created in two steps. Firstly, it transforms the RDF graph into forest of trees and then to each tree creates its extended signature. The signatures are accompanied by the additional information about transformed problematic nodes breaking the tree structure. (en)
Title
  • Designing Indexing Structure for Discovering Relationships in RDF Graphs
  • Designing Indexing Structure for Discovering Relationships in RDF Graphs (en)
  • Návrh indexační struktury pro vyhledávání vztahů v RDF grafech (cs)
skos:prefLabel
  • Designing Indexing Structure for Discovering Relationships in RDF Graphs
  • Designing Indexing Structure for Discovering Relationships in RDF Graphs (en)
  • Návrh indexační struktury pro vyhledávání vztahů v RDF grafech (cs)
skos:notation
  • RIV/00216224:14330/04:00010211!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany
  • 1-11
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 143300004)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 559908
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/04:00010211
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • RDF graphs; tree signatures; graph transformations; path indexing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [17B4B7B852D9]
http://linked.open...v/mistoKonaniAkce
  • Desná
http://linked.open...i/riv/mistoVydani
  • Ostrava
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Dateso 2004 Annual International Workshop on DAtabases, TExts, Specifications and Objects
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bartoň, Stanislav
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoká škola báňská - Technická univerzita Ostrava
https://schema.org/isbn
  • 80-248-0457-3
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software