Real-scale Semantic Web applications, such as Knowledge Portals and E-Marketplaces, require the management of large volumes metadata, i.e., information describing available content services. Better knowledge about their meaning, usage, accessibility or quality will considerably facilitate an automated processing resources. The Resource Description Framework (RDF) enables creation exchange metadata normal data. Although voluminous RDF descriptions are already appearing, sufficiently...

Structured documents (e.g., SGML) can benefit a lot from database support and more specifically object-oriented (OODB) management systems. This paper describes natural mapping SGML into OODB's formal extension of two OODB query languages (one SQL-like the other calculus) in order to deal with document retrieval. Although motivated by structured documents, extensions that we present are general useful for variety applications. A key element is introduction paths as first class citizens. The...

The emerging paradigm of electronic services promises to bring distributed computation and the flexibility that web has brought sharing documents. An understanding fundamental properties e-service composition is required in order take full advantage paradigm. This paper examines proposals standards for e-services from perspectives XML, data management, workflow, process models. Key areas study are identified, including behavioral service signatures, verification synthesis techniques...

Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to large join order search space. In such cases, cost-based query often not possible. One practical reason for this that statistics are missing web scale setting the Linked Open Datasets (LOD). The profound due absence of schematic structure RDF, join-hit ratio estimation requires complicated forms correlated statistics; currently...

We present the Parallel, Forward–Backward with Pruning (PFBP) algorithm for feature selection (FS) Big Data of high dimensionality. PFBP partitions data matrix both in terms rows as well columns. By employing concepts p-values conditional independence tests and meta-analysis techniques, relies only on computations local to a partition while minimizing communication costs, thus massively parallelizing computations. Similar techniques combining are also employed create final predictive model....

Modern applications (Web portals, digital libraries, etc.) require integrated access to various information sources (from traditional DBMS semistructured Web repositories), fast deployment and low maintenance cost in a rapidly evolving environment. Because of its flexibility, there is an increasing interest using XML as middleware model for such applications. enables wrapping declarative integration. However, query processing XML-based integration systems still penalized by the lack algebra...

With the increasing use of Web 2.0 to create, disseminate, and consume large volumes data, more information is published becomes available for potential data consumers, that is, applications/services, individual users communities, outside their production site. The most representative example this trend Linked Open Data (LOD), a set interlinked knowledge bases. main challenge in context governance within loosely coordinated organizations are publishing added-value on Web, bringing together...

This paper focuses on the optimization of navigation through voluminous subsumption hierarchies topics employed by Portal Catalogs like Netscape Open Directory (ODP). We advocate for use labeling schemes modeling these in order to efficiently answer queries such as check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. first give a qualitative comparison three main families schemes, namely bit vector, prefix and interval based...

In the past few years, query languages featuring generalized path expressions have been proposed. These allow interrogation of both data and structure. They are powerful essential for a number applications. However, until now, their evaluation has relied on rather naive inefficient algorithm.In this paper, we extend an object algebra with two new operators present some interesting rewriting techniques queries expressions. We also show how optimizer can integrate techniques.

In this paper, we measure and analyze the graph features of semantic Web (SW) schemas with focus on power-law degree distributions. Our main finding is that majority SW a significant number properties (respectively, classes) approximate power law for total-degree subsumed distribution. Moreover, our analysis revealed some emerging conceptual modeling practices schema developers: (1) each has few focal classes have been analyzed in detail (that is, they numerous subclasses), which are further...

Modern applications (Web portals, digital libraries, etc.) require integrated access to various information sources (from traditional DBMS semistructured Web repositories), fast deployment and low maintenance cost in a rapidly evolving environment. Because of its flexibility, there is an increasing interest using XML as middleware model for such applications. enables wrapping declarative integration. However, query processing XML-based integration systems still penalized by the lack algebra...