Filters








7,518 Hits in 5.7 sec

Querying RDF Data from a Graph Database Perspective [chapter]

Renzo Angles, Claudio Gutierrez
2005 Lecture Notes in Computer Science  
We concentrate on query languages, analyze current RDF trends, and propose the incorporation to RDF query languages of primitives which are not present today, based on the experience and techniques of  ...  From this point of view it is compared with other database models, particularly with graph database models, which are very close in motivations and use cases to RDF.  ...  Object oriented data models ([Kim90] ) are based on the object-oriented programming paradigm.  ... 
doi:10.1007/11431053_24 fatcat:gia7gzrs2jhjdlecw3vvexop6y

A Comparison of Current Graph Database Models

Renzo Angles
2012 2012 IEEE 28th International Conference on Data Engineering Workshops  
Our review includes general features (for data storing and querying), data modeling features (i.e., data structures, query languages, and integrity constraints), and the support for essential graph queries  ...  In this paper we present a systematic comparison of current graph database models.  ...  Instead they are based on special functions that allow to summarize or operate on the query results, normally returning a single value.  ... 
doi:10.1109/icdew.2012.31 dblp:conf/icde/Angles12 fatcat:qnq5x6mjdzdezltn537vakgt2u

Object classification based on graph kernels

Amal Mahboubi, Luc Brun, Francois-Xavier Dupe
2010 2010 International Conference on High Performance Computing & Simulation  
This article describes an image object classification method based on a definite positive graph kernel inducing a metric between graphs.  ...  Graphs are natural data structures to model such relationships with nodes representing features and edges encoding relationships between them.  ...  CONCLUSION In this study, a graph kernel method for object retrieval has been proposed with an application to face recognition. We defined a graph kernel based on bags of oriented neighborhoods.  ... 
doi:10.1109/hpcs.2010.5547109 dblp:conf/ieeehpcs/MahboubiBD10 fatcat:coqaviyzabdqzekhoooe2oorry

A New Similarity Measure for Spatial Personalization

Saida Aissa
2012 International Journal of Database Management Systems  
As a solution, we propose to study the similarity between the behaviors of the users, in term of the spatial MDX queries launched on the system, as a basis to recommend the next relevant MDX query to the  ...  The proposed similarity measure takes into account the basic components of the similarity assessment models: the topology, the direction and the distance  ...  [14] propose changes on the topological relationship based on the Egenhofer's 9-intersection model. They presented a conceptual neighborhood graph of the topological relationship.  ... 
doi:10.5121/ijdms.2012.4401 fatcat:iiuodlujofcq3j6ctkdq36pzl4

Indexing and retrieval of video based on spatial relation sequences

Serhan Dağtaş, Arif Ghafoor
1999 Proceedings of the seventh ACM international conference on Multimedia (Part 2) - MULTIMEDIA '99  
Such descriptions are used for content-baaed retrieval processing baaed on a graphical representation, named Coordinate Valued Neighborhood Graph.  ...  This is due to the dependency of the complex content descriptions on the apatio-temporal features.  ...  Significant work has been reported on spatial modeling of images. In [8] , an algorithm based on spatial orientation graph is presented.  ... 
doi:10.1145/319878.319910 dblp:conf/mm/DagtasG99 fatcat:fcknrcn46bgajap7lpbqqm7oje

Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries [article]

Maciej Besta, Emanuel Peter, Robert Gerstenberger, Marc Fischer, Michał Podstawski, Claude Barthels, Gustavo Alonso, Torsten Hoefler
2021 arXiv   pre-print
We focus on identifying and analyzing fundamental categories of these systems (e.g., triple stores, tuple stores, native graph database systems, or object-oriented systems), the associated graph models  ...  We outline graph database queries and relationships with associated domains (NoSQL stores, graph streaming, and dynamic graph algorithms).  ...  One can also use collections of objects in Object-Oriented Database Management Systems (OODBMS) [14] to model graphs.  ... 
arXiv:1910.09017v5 fatcat:ta4pzurv3ndyngzjfpl7vhvcui

VeilGraph: Streaming Graph Approximations [article]

Miguel E. Coimbra, Sérgio Esteves, Alexandre P. Francisco, Luís Veiga
2019 arXiv   pre-print
We showcase an innovative model for approximate graph processing, implemented in Apache Flink.  ...  favoring Flink for comparability, show that can improve performance up to 3X speedups, while achieving result quality above 95% when compared to results of the traditional version of PageRank without any summarization  ...  This model is based on a vertex-centric breadth-first neighborhood expansion.  ... 
arXiv:1810.02781v4 fatcat:dnag2zunufdjxoqpehey4hx76u

An introduction to Graph Data Management [article]

Renzo Angles, Claudio Gutierrez
2017 arXiv   pre-print
A graph database is a database where the data structures for the schema and/or instances are modeled as a (labeled)(directed) graph or generalizations of it, and where querying is expressed by graph-oriented  ...  In this article we present the basic notions of graph databases, give an historical overview of its main development, and study the main current systems that implement them.  ...  GROOVY [105] is an object-oriented data model based on hypergraphs.  ... 
arXiv:1801.00036v1 fatcat:lvukdfsw2vbylagptodbahqi54

Subgraph Isomorphism Search in Massive Graph Databases

Chemseddine Nabti, Hamida Seba
2016 Proceedings of the International Conference on Internet of Things and Big Data  
However, querying graph data is different and more complex than querying relational table-based data.  ...  modeling.  ...  Data: A summarized data graph C(G) and a summarized query C(Q).  ... 
doi:10.5220/0005875002040213 dblp:conf/iotbd/NabtiS16 fatcat:cfcrguampravjmgqwiapfvhf4q

Know Thy Neighbors, and More!

Sumit Bhatia, Harit Vishwakarma
2018 Proceedings of the 29th on Hypertext and Social Media - HT '18  
Most of the state-of-the-art methods in entity recommendation are limited in the sense that they allow users to search only in the immediate neighborhood of the entity of interest.  ...  Knowledge Graphs capture the semantic relations between realworld entities and can thus, allow end-users to explore different aspects of an entity of interest by traversing through the edges in the graph  ...  Note that just like Adamic-Adar and other neighborhood based methods, this measure also relies only on the neighborhood information of input entities and is therefore, easy to compute even on large graphs  ... 
doi:10.1145/3209542.3209548 dblp:conf/ht/BhatiaV18 fatcat:7hdykloynzexdfvwunwe36zq7a

Query Driven Localized Linear Discriminant Models for Head Pose Estimation

Zhu Li, Yun Fu, Junsong Yuan, Thomas S. Huang, Ying Wu
2007 Multimedia and Expo, 2007 IEEE International Conference on  
The performance of the head pose estimation is heavily dependent on the accuracy of structure learnt and the discriminating power of the metric.  ...  In this work we develop a query point driven, localized linear subspace learning method that approximates the non-linearity of the head pose manifold structure with piece-wise linear discriminating subspaces  ...  The discriminating power of the local metric is enhanced through pruning embedded graph edges by limiting the model to an appropriate local neighborhood.  ... 
doi:10.1109/icme.2007.4285024 dblp:conf/icmcs/LiFYHW07 fatcat:b2ksnolrurb5jeqtthop3yz5hu

Research on Service Discovery Methods Based on Knowledge Graph

Li Guodong, Qiu Zhang, Yongkai Ding, Wang Zhe
2020 IEEE Access  
This paper makes in-depth research on the key issues of knowledge graph matching for service-oriented discovery.  ...  Service discovery is one of the main goals of a service-oriented architecture, helping to discover complex applications.  ...  EXPERIMENT Earlier we introduced how to build a knowledge graph for service-oriented discovery and the generation of query templates based on knowledge graph.  ... 
doi:10.1109/access.2020.3012670 fatcat:p5e3j6aqrraydflqxddotuhip4

Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing

Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, T.S. Huang
2008 IEEE transactions on circuits and systems for video technology (Print)  
As a new algorithm design based on the proposed framework, the query-driven locally adaptive (QDLA) mixture-of-experts model for robust face recognition and head pose estimation is presented.  ...  On the other hand, we address the problem of numerical difficulty in the large-size pattern classification case, where many local variations cannot be adequately handled by a single global model.  ...  We instead use LSH [1] , [13] to speed up the NN query. The local model can then be built based on the NNs of the query.  ... 
doi:10.1109/tcsvt.2008.2004933 fatcat:szdl5lkhbfbx7ihwhf6ryuwsya

On graph query optimization in large networks

Peixiang Zhao, Jiawei Han
2010 Proceedings of the VLDB Endowment  
In this paper, we present a high performance graph indexing mechanism, SPath, to address the graph query problem on large networks.  ...  Our experimental studies demonstrate the effectiveness and scalability of SPath, which proves to be a more practical and efficient indexing method in addressing graph queries on large networks.  ...  Our main contributions can be summarized as follows: 1. We propose a pattern based graph indexing framework to address the graph query problem on large networks.  ... 
doi:10.14778/1920841.1920887 fatcat:pswxpinhlzc2rcmdzzfwol4hey

Graphs-at-a-time

Huahai He, Ambuj K. Singh
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
We propose a query language for graph databases that supports arbitrary attributes on nodes, edges, and graphs.  ...  In this language, graphs are the basic unit of information and each query manipulates one or more collections of graphs.  ...  Third, we optimize the search order based on a cost model designed for graphs.  ... 
doi:10.1145/1376616.1376660 dblp:conf/sigmod/HeS08 fatcat:dpsin5wpj5azffiqlvttjjs3oa
« Previous Showing results 1 — 15 out of 7,518 results