arXiv - CS - Databases最新文献_第9页

Saving Money for Analytical Workloads in the Cloud 为云分析工作负载节省资金

arXiv - CS - Databases Pub Date : 2024-08-01 DOI: arxiv-2408.00253

Tapan Srivastava, Raul Castro Fernandez

引用次数: 0

Hybrid Querying Over Relational Databases and Large Language Models 关系数据库和大型语言模型的混合查询

arXiv - CS - Databases Pub Date : 2024-08-01 DOI: arxiv-2408.00884

Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi

引用次数: 0

Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability 具有可解释性的时态知识图谱异常在线检测

arXiv - CS - Databases Pub Date : 2024-08-01 DOI: arxiv-2408.00872

Jiasheng Zhang, Jie Shao, Rex Ying

{"title":"Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability","authors":"Jiasheng Zhang, Jie Shao, Rex Ying","doi":"arxiv-2408.00872","DOIUrl":"https://doi.org/arxiv-2408.00872","url":null,"abstract":"Temporal knowledge graphs (TKGs) are valuable resources for capturing\u0000evolving relationships among entities, yet they are often plagued by noise,\u0000necessitating robust anomaly detection mechanisms. Existing dynamic graph\u0000anomaly detection approaches struggle to capture the rich semantics introduced\u0000by node and edge categories within TKGs, while TKG embedding methods lack\u0000interpretability, undermining the credibility of anomaly detection. Moreover,\u0000these methods falter in adapting to pattern changes and semantic drifts\u0000resulting from knowledge updates. To tackle these challenges, we introduce\u0000AnoT, an efficient TKG summarization method tailored for interpretable online\u0000anomaly detection in TKGs. AnoT begins by summarizing a TKG into a novel rule\u0000graph, enabling flexible inference of complex patterns in TKGs. When new\u0000knowledge emerges, AnoT maps it onto a node in the rule graph and traverses the\u0000rule graph recursively to derive the anomaly score of the knowledge. The\u0000traversal yields reachable nodes that furnish interpretable evidence for the\u0000validity or the anomalous of the new knowledge. Overall, AnoT embodies a\u0000detector-updater-monitor architecture, encompassing a detector for offline TKG\u0000summarization and online scoring, an updater for real-time rule graph updates\u0000based on emerging knowledge, and a monitor for estimating the approximation\u0000error of the rule graph. Experimental results on four real-world datasets\u0000demonstrate that AnoT surpasses existing methods significantly in terms of\u0000accuracy and interoperability. All of the raw datasets and the implementation\u0000of AnoT are provided in https://github.com/zjs123/ANoT.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New Compressed Indices for Multijoins on Graph Databases 用于图数据库多重连接的新压缩索引

arXiv - CS - Databases Pub Date : 2024-08-01 DOI: arxiv-2408.00558

Diego Arroyuelo, Fabrizio Barisione, Antonio Fariña, Adrián Gómez-Brandón, Gonzalo Navarro

引用次数: 0

eSPARQL: Representing and Reconciling Agnostic and Atheistic Beliefs in RDF-star Knowledge Graphs eSPARQL：在 RDF-star 知识图谱中表示和调和不可知论与无神论信仰

arXiv - CS - Databases Pub Date : 2024-07-31 DOI: arxiv-2407.21483

Xiny Pan, Daniel Hernández, Philipp Seifer, Ralf Lämmel, Steffen Staab

{"title":"eSPARQL: Representing and Reconciling Agnostic and Atheistic Beliefs in RDF-star Knowledge Graphs","authors":"Xiny Pan, Daniel Hernández, Philipp Seifer, Ralf Lämmel, Steffen Staab","doi":"arxiv-2407.21483","DOIUrl":"https://doi.org/arxiv-2407.21483","url":null,"abstract":"Over the past few years, we have seen the emergence of large knowledge graphs\u0000combining information from multiple sources. Sometimes, this information is\u0000provided in the form of assertions about other assertions, defining contexts\u0000where assertions are valid. A recent extension to RDF which admits statements\u0000over statements, called RDF-star, is in revision to become a W3C standard.\u0000However, there is no proposal for a semantics of these RDF-star statements nor\u0000a built-in facility to operate over them. In this paper, we propose a query\u0000language for epistemic RDF-star metadata based on a four-valued logic, called\u0000eSPARQL. Our proposed query language extends SPARQL-star, the query language\u0000for RDF-star, with a new type of FROM clause to facilitate operating with\u0000multiple and sometimes conflicting beliefs. We show that the proposed query\u0000language can express four use case queries, including the following features:\u0000(i) querying the belief of an individual, (ii) the aggregating of beliefs,\u0000(iii) querying who is conflicting with somebody, and (iv) beliefs about beliefs\u0000(i.e., nesting of beliefs).","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Complete Approximations of Incomplete Queries 不完整查询的完整近似值

arXiv - CS - Databases Pub Date : 2024-07-30 DOI: arxiv-2407.20932

Julien Corman, Werner Nutt, Ognjen Savković

引用次数: 0

Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions 简单正则表达式上连接正则路径查询的联合有界性

arXiv - CS - Databases Pub Date : 2024-07-30 DOI: arxiv-2407.20782

Diego Figueira, S. Krishna, Om Swostik Mishra, Anantha Padmanabha

引用次数: 0

Urban Traffic Accident Risk Prediction Revisited: Regionality, Proximity, Similarity and Sparsity 重新审视城市交通事故风险预测：区域性、邻近性、相似性和稀疏性

arXiv - CS - Databases Pub Date : 2024-07-29 DOI: arxiv-2407.19668

Minxiao Chen, Haitao Yuan, Nan Jiang, Zhifeng Bao, Shangguang Wang

{"title":"Urban Traffic Accident Risk Prediction Revisited: Regionality, Proximity, Similarity and Sparsity","authors":"Minxiao Chen, Haitao Yuan, Nan Jiang, Zhifeng Bao, Shangguang Wang","doi":"arxiv-2407.19668","DOIUrl":"https://doi.org/arxiv-2407.19668","url":null,"abstract":"Traffic accidents pose a significant risk to human health and property\u0000safety. Therefore, to prevent traffic accidents, predicting their risks has\u0000garnered growing interest. We argue that a desired prediction solution should\u0000demonstrate resilience to the complexity of traffic accidents. In particular,\u0000it should adequately consider the regional background, accurately capture both\u0000spatial proximity and semantic similarity, and effectively address the sparsity\u0000of traffic accidents. However, these factors are often overlooked or difficult\u0000to incorporate. In this paper, we propose a novel multi-granularity\u0000hierarchical spatio-temporal network. Initially, we innovate by incorporating\u0000remote sensing data, facilitating the creation of hierarchical\u0000multi-granularity structure and the comprehension of regional background. We\u0000construct multiple high-level risk prediction tasks to enhance model's ability\u0000to cope with sparsity. Subsequently, to capture both spatial proximity and\u0000semantic similarity, region feature and multi-view graph undergo encoding\u0000processes to distill effective representations. Additionally, we propose\u0000message passing and adaptive temporal attention module that bridges different\u0000granularities and dynamically captures time correlations inherent in traffic\u0000accident patterns. At last, a multivariate hierarchical loss function is\u0000devised considering the complexity of the prediction purpose. Extensive\u0000experiments on two real datasets verify the superiority of our model against\u0000the state-of-the-art methods.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"76 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Rosetta Statements: Lowering the Barrier for Semantic Parsing and Increasing the Cognitive Interoperability of Knowledge Graphs 罗塞塔语句：降低语义解析障碍，提高知识图谱的认知互操作性

arXiv - CS - Databases Pub Date : 2024-07-29 DOI: arxiv-2407.20007

Lars Vogt, Marcel Konrad, Kheir Eddine Farfar, Manuel Prinz, Allard Oelen

{"title":"Rosetta Statements: Lowering the Barrier for Semantic Parsing and Increasing the Cognitive Interoperability of Knowledge Graphs","authors":"Lars Vogt, Marcel Konrad, Kheir Eddine Farfar, Manuel Prinz, Allard Oelen","doi":"arxiv-2407.20007","DOIUrl":"https://doi.org/arxiv-2407.20007","url":null,"abstract":"Machines need data and metadata to be machine-actionable and FAIR (findable,\u0000accessible, interoperable, reusable) to manage increasing data volumes.\u0000Knowledge graphs and ontologies are key to this, but their use is hampered by\u0000high access barriers due to required prior knowledge in semantics and data\u0000modelling. The Rosetta Statement approach proposes modeling English natural\u0000language statements instead of a mind-independent reality. We propose a\u0000metamodel for creating semantic schema patterns for simple statement types. The\u0000approach supports versioning of statements and provides a detailed editing\u0000history. Each Rosetta Statement pattern has a dynamic label for displaying\u0000statements as natural language sentences. Implemented in the Open Research\u0000Knowledge Graph (ORKG) as a use case, this approach allows domain experts to\u0000define data schema patterns without needing semantic knowledge. Future plans\u0000include combining Rosetta Statements with semantic units to organize ORKG into\u0000meaningful subgraphs, improving usability. A search interface for querying\u0000statements without needing SPARQL or Cypher knowledge is also planned, along\u0000with tools for data entry and display using Large Language Models and NLP. The\u0000Rosetta Statement metamodel supports a two-step knowledge graph construction\u0000procedure. Domain experts can model semantic content without support from\u0000ontology engineers, lowering entry barriers and increasing cognitive\u0000interoperability. The second level involves developing semantic graph patterns\u0000for reasoning, requiring collaboration with ontology engineers.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"150 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Limitations of Validity Intervals in Data Freshness Management 数据新鲜度管理中有效性区间的局限性

arXiv - CS - Databases Pub Date : 2024-07-29 DOI: arxiv-2407.20431

Kyoung-Don Kang

引用次数: 0