About: The Geometric Framework for Exact and Similarity Querying XML data

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: The Geometric Framework for Exact and Similarity Querying XML data 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. Had we consider a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries. Using the terminology usual in databases, it is possible to view XML as a language for data modeling. To retrieve XML data from XML databases, several query languages have been proposed. The common feature of such languages is the use of regular path expressions. They enable the user to navigate through arbitrary long paths in XML data. Had we consider a path content as a vector of path elements, we would be able to model XML paths as points within a multidimensional vector space. This paper introduces a geometric framework for indexing and querying XML data conceived in this way. In consequence, we can use certain data structures for indexing multidimensional points (objects). We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather to exact matching queries while the structures for indexing the metric spaces allow us to provide the similarity queries. (en)
Title	The Geometric Framework for Exact and Similarity Querying XML data The Geometric Framework for Exact and Similarity Querying XML data (en)
skos:prefLabel	The Geometric Framework for Exact and Similarity Querying XML data The Geometric Framework for Exact and Similarity Querying XML data (en)
skos:notation	RIV/61989100:27240/02:00006701!RIV/2003/GA0/272403/N
http://linked.open.../vavai/riv/strany	35 - 46
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA201/00/1031)
http://linked.open...vai/riv/dodaniDat	2003
http://linked.open...aciTvurceVysledku	Krátký, Michal Snášel, Václav Skopal, Tomáš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	647080
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/02:00006701
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	XML,XML indexing,data structure,UB-tree,M-tree (en)
http://linked.open.../riv/klicoveSlovo	XML data structure UB-tree XML indexing M-tree
http://linked.open...ontrolniKodProRIV	[1EC9A9F6D484]
http://linked.open...v/mistoKonaniAkce	Shiraz, Iran
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	EurAsia-ICT 2002
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...vavai/riv/projekt	Intelligent retrieval in document information systems
http://linked.open...UplatneniVysledku	2002
http://linked.open...iv/tvurceVysledku	Pokorný, J. Snášel, Václav Skopal, Tomáš Krátký, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2002-10-27 (xsd:date)
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	3-540-00028-3
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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