Search Results

Graph databases have gained popularity in modeling complex data domains. The growing demand for big graph data necessitates efficient query processing. However, existing systems often overlook the importance of graph schema. This paper highlights ...

Due to the economic and societal problems being caused by the Web's growing centralization, there is an increasing interest in de-centralizing data on the Web. This decentralization does however cause a number of technical challenges. If we want to give ...

The problem of search relevance in the E-commerce domain is a challenging one since it involves understanding the intent of a user's short nuanced query and matching it with the appropriate products in the catalog. This problem has traditionally been ...

We propose a method to enable Large Language Models to access Knowledge Graph (KG) data and justify their text generation by showing the specific graph data the model accessed during inference. For this, we combine Language Models with methods from ...

We introduce Object Graph Programming (OGO), which enables reading and modifying an object graph (i.e., the entire state of the object heap) via declarative queries. OGO models the objects and their relations in the heap as an object graph thereby ...

Considerable effort is required to consolidate diverse data sets for carrying out energy benchmarking studies at a site level. This could range from non-availability of smart meter data, sparse metering data, ambiguous metering hierarchy to name a few.

...

Our research article presents a recommender system for datasets, models, and processing steps that is based on utilizing metadata characteristics, content, and usage history to understand the intent of artifacts in a data lineage. Our system utilizes ...

With an exponentially growing number of graphs from disparate repositories, there is a strong need to analyze a graph database containing an extensive collection of small- or medium-sized data graphs (e.g., chemical compounds). Although subgraph ...

We parameterize schemata in Boyce-Codd Normal Form (BCNF) by the number n of minimal keys they exhibit. We show that n quantifies a trade-off between access variety and update complexity. Indeed, access variety refers to the number of different ways by ...

The semantic web is built with the support of resource description framework (RDF). The changing faces of semantic web created the requirement of new approaches to store and query the RDF data. The RDF data contains large volume of data that have more ...

The large search companies have very clearly shown that full-text search on very large datasets can be executed efficiently. In this paper, we show how querying spatio-temporal trajectory data can be converted to a full-text search problem. This allows ...

SPARQL is the standard query language for RDF as stated by the W3C. It is a highly expressive querying language that contains the standard operations based on set algebra, as well as navigational operations found in graph querying languages. Because of ...

Networks in many real-world applications come with an inherent uncertainty in their structure, due to e.g., noisy measurements, inference and prediction models, or for privacy purposes. Modeling and analyzing uncertain graphs has attracted a great deal ...

Query autocompletion is an essential feature in search engines that predicts and suggests query completions to a user's incomplete prefix input, a critical feature to enhance the user experience. While a generic lookup-based system can provide ...

As location-aware information becomes more popular, many researchers have been proposed many effective approaches to solving the problem. In this work, we identify the shortcomings of the existing method from the LINQ framework as our baseline. After that,...

The traditional global tourism information query method cannot mine the internal relevance of discrete information, which leads to the problem of inaccurate query results and long query response time. This paper proposes a method of global tourism ...

We consider the minimum spanning tree (MST) problem in an uncertainty model where interval edge weights can be explored to obtain the exact weight. The task is to find an MST by querying the minimum number of edges. This problem has received quite some ...

The web services are from different sources, heterogeneous, and of large volume. The user is in a crucial situation to select the best web services. The web service selection process aims to discovery the desired web services; as it allows to select the ...

Multi-Video summarisation frameworks aim to extract representative frames from a collection of videos. In the proposed framework, a multi-video summarisation model is implemented that detects key frames from a collection of related videos on the basis ...

Simulation can be a powerful technique for evaluating the performance of large-scale cloud computing services in a relatively low cost, low risk and time-sensitive manner. Large-scale data indexing, distribution and management is complex to analyse in a ...