About: A Cost-based Join Selection for XML Twig Content-based Queries

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

About: A Cost-based Join Selection for XML Twig Content-based Queries 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
rdfs:seeAlso	http://dl.acm.org/citation.cfm?id=1416696
Description	XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g., articles in a digital library, documents on the web, and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques. Many different techniques of XML indexing have been proposed during recent years. If we consider some classes of indexing methods, we distinguish two kinds of joins for processing twig queries. Although authors propose improvements of their joins, there has not yet been a discussion about the advantages of applying various join operations. In this article, we propose a join selection based on the cost of a join. By choosing a more appropriate join operation, twig query processing efficiency is significantly improved. XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g., articles in a digital library, documents on the web, and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques. Many different techniques of XML indexing have been proposed during recent years. If we consider some classes of indexing methods, we distinguish two kinds of joins for processing twig queries. Although authors propose improvements of their joins, there has not yet been a discussion about the advantages of applying various join operations. In this article, we propose a join selection based on the cost of a join. By choosing a more appropriate join operation, twig query processing efficiency is significantly improved. (en)
Title	A Cost-based Join Selection for XML Twig Content-based Queries A Cost-based Join Selection for XML Twig Content-based Queries (en)
skos:prefLabel	A Cost-based Join Selection for XML Twig Content-based Queries A Cost-based Join Selection for XML Twig Content-based Queries (en)
skos:notation	RIV/61989100:27240/08:00019955!RIV13-GA0-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA201/06/0756), P(GP201/06/P113)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Bača, Radim Krátký, Michal
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	354147
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/08:00019955
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	XML twig queries, content-based queries, cost-based join selection (en)
http://linked.open.../riv/klicoveSlovo	XML twig queries content-based queries cost-based join selection
http://linked.open...ontrolniKodProRIV	[1C26C0826D14]
http://linked.open...v/mistoKonaniAkce	Nantes
http://linked.open...i/riv/mistoVydani	Seattle, WA
http://linked.open...i/riv/nazevZdroje	DataX 08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Development of a native storage for XML data Methods for efficient searching in large collections of semi-structured data
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Bača, Radim Krátký, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2008-03-25 (xsd:date)
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/1416691.1416696
http://purl.org/ne...btex#hasPublisher	ACM
https://schema.org/isbn	978-1-59593-966-1
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	A Cost-based Join Selection for XML Twig Content-based Queries

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software