Efficient XML Keyword Search based on DAG-Compression

In contrast to XML query languages as e.g. XPath which require knowledge on the query language as well as on the document structure, keyword search is open to anybody. As the size of XML sources grows rapidly, the need for efficient search indices on XML data that support keyword search increases. In this paper, we present an approach of XML keyword search which is based on the DAG of the XML data, where repeated substructures are considered only once, and therefore, have to be searched only once. As our performance evaluation shows, this DAG-based extension of the set intersection search algorithm[1], [2], can lead to search times that are on large documents more than twice as fast as the search times of the XML-based approach. Additionally, we utilize a smaller index, i.e., we consume less main memory to compute the results

ITR: A grammar-based graph compressor supporting fast neighborhood queries

Neighborhood queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compression scheme called Incidence-Type-RePair (ITR) for graphs with labeled nodes and labeled edges based on RePair and apply the scheme to RDF graphs. We show that ITR speeds up neighborhood queries to only a few milliseconds and thereby outperforms existing solutions while providing a compression size comparable to existing RDF graph compressors

Conservation of pollinators in traditional agricultural landscapes – New challenges in Transylvania (Romania) posed by EU accession and recommendations for future research

Farmland biodiversity is strongly declining in most of Western Europe, but still survives in traditional low intensity agricultural landscapes in Central and Eastern Europe. Accession to the EU however intensifies agriculture, which leads to the vanishing of traditional farming. Our aim was to describe the pollinator assemblages of the last remnants of these landscapes, thus set the baseline of sustainable farming for pollination, and to highlight potential measures of conservation. In these traditional farmlands in the Transylvanian Basin, Romania (EU accession in 2007), we studied the major pollinator groups-wild bees, hoverflies and butterflies. Landscape scale effects of semi-natural habitats, land cover diversity, the effects of heterogeneity and woody vegetation cover and on-site flower resources were tested on pollinator communities in traditionally managed arable fields and grasslands. Our results showed: (i) semi-natural habitats at the landscape scale have a positive effect on most pollinators, especially in the case of low heterogeneity of the direct vicinity of the studied sites; (ii) both arable fields and grasslands hold abundant flower resources, thus both land use types are important in sustaining pollinator communities; (iii) thus, pollinator conservation can rely even on arable fields under traditional management regime. This has an indirect message that the tiny flower margins around large intensive fields in west Europe can be insufficient conservation measures to restore pollinator communities at the landscape scale, as this is still far the baseline of necessary flower resources. This hypothesis needs further study, which includes more traditional landscapes providing baseline, and exploration of other factors behind the lower than baseline level biodiversity values of fields under agri-environmental schemes (AES)

Multimedia Markup Editor (M3): A Semi-automatic Annotation Software for Static Image-Text Media

Abstract and poster of paper 0616 presented at the Digital Humanities Conference 2019 (DH2019), Utrecht , the Netherlands 9-12 July, 2019

Quantifying Complexity in Multimodal Media: Alan Moore and the “Density” of the Graphic Novel

Abstract of paper 0558 presented at the Digital Humanities Conference 2019 (DH2019), Utrecht , the Netherlands 9-12 July, 2019

Quantifying Complexity in Multimodal Media: Alan Moore and the “Density” of the Graphic Novel

Abstract of paper 0558 presented at the Digital Humanities Conference 2019 (DH2019), Utrecht , the Netherlands 9-12 July, 2019