Creation and interaction with large-scale domain-specific knowledge bases

Bharadwaj, Samarth; Chiticariu, Laura; Danilevsky, Marina; Dhingra, Sunita; Divekar, Sarit; Carreno-Fuentes, A.; Gupta, Himanshu; Gupta, Nisha; Han, Sangdo; Hernández, Mauricio A.; Ho, H.; Jain, Prateek; Joshi, Sachindra; Karanam, Hima; Krishnan, Sunder Ram; Krishnamurthy, Rajasekar; Li, Y.; Manivannan, S.; Mittal, Anshul; Özcan, Fatma; Quamar, Abdul; Raman, Poornima Chozhiyath; Saha, Diptikalyan; Sankaranarayanan, Karthik; Sen, Jonaki; Sen, Prithviraj; Vaithyanathan, Shivakumar; Vasa, Mitesh; Wang, H.; Zhu, Hao

doi:10.14778/3137765.3137820

Cited by 13 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the main research directions of databases, data storage has received extensive attention. The traditional storage mechanisms include the storage model of the row, column, key [10], document and object exchange [11], etc. Besides, since complex relational data forms a network structure, a graph model is needed to the commitment to the management of rich related data [12].…”

Section: A Graph Storage Modelsmentioning

confidence: 99%

Graph Compression Storage Based on Spatial Cluster Entity Optimization

2020

View full text Add to dashboard Cite

Graph storage technology is confronted with an enormous challenge as far as the compact and complex graph-structure data. This phenomenon is derived from social networks with spatially intensive data. Since a hot event can cause the generation of a network cluster, which consists of a massive duplicate associated entities in the social networks, the space utilization and processing speed of graph data is obstructed. Therefore, it is necessary to design a graph storage mechanism specifically for the above data. In this paper, we propose a Graph compression Storage engine based on spatial Cluster entity Optimization (GSCO), which improves the native graph storage model through the proposed the many-to-one mapping structure and a Heat Evolution Elimination algorithm (H2E). Firstly, we define the spatial cluster entity formally and confirm the compressed storage objects. Then, we introduce the many-to-one relationship to transfer the mapping structure between the node and property. It compresses the data to raise the space utilization of the graph database. Finally, we propose the H2E algorithm that allows the representative nodes to be anchored an extended period in memory according to the heat evolution acceleration. It increases the hit rate and throughput and reduces the I/O operation by deleting the redundancy of data. Extensive experiments results show that the proposed GSCO storage model is better than Neo4j for reading and writing data in spatial clustering entity. It significantly promotes the effectiveness of graph operation, including the data loading, the common queries, and the clustering test.INDEX TERMS Graph compression storage, social networks, spatial cluster entity, heat evolution.

show abstract

Section: A Graph Storage Modelsmentioning

confidence: 99%

Graph Compression Storage Based on Spatial Cluster Entity Optimization

2020

View full text Add to dashboard Cite

show abstract

“…Bharadwaj et al [6] introduced a model for high-power distributed computer management that describes a network of logical machines over time and space. In this work, a resource management system was used to supply resource and resource abstracted over large-scale distributed resources through resource programming.…”

Section: Related Workmentioning

confidence: 99%

“…OPM is a finished completing model for cautiously separating the beginning of anything on the web [6]. OPM permits provenance information to be showcased between various divisions, similarly as arrangement assists with making provenance systems dependent on a common provenance model [6]. OPM depends on three components.…”

Section: Open Provenance Modelmentioning

confidence: 99%

“…The properties of this dispatch area unit as per the following: Ts = property, Qs = SP ARQL, Ss = string_id, Js = RDBMS_based, caesium = reif ied_statement, Ds = RDB, Dm = does not exist, Qm = does not exist, Sm = does not exist. a few cluster of data developed from the information set network, pitched battle may be a language community that kinds out the language condition in Java RDF [6,17]. It offers straightforwardness yield ANd RDF chart the executives interface is spoken to in vast memory and is upheld up by an info base motor.…”

Section: F Apache Pitched Battlementioning

confidence: 99%

“…This record presents ProvONE, a model for genuine work measure provenance that plans to satisfy the necessities of the ideal norm [6]. The name begins from its progress regarding the DataONE Project, which is making an enormous expansion and joined information structure serving the examinations of the planet association.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Stalking the Resources for Security in Linked Data Applications Using Resource Description Framework

Murty¹,

Rao²

2020

ISI

View full text Add to dashboard Cite

Following the accessibility of Resource Description Framework (RDF) resources is a key capacity in the establishment of Linked Data frameworks. It replaces center around information reconciliation contrasted with work rate. Exceptional Connected Data that empowers applications to improve by changing over legacy information into RDF resources. This data contains bibliographic, geographic, government, arrangement, and alternate routes. Regardless, a large portion of them don't monitor the subtleties and execution of each sponsored resource. In such cases, it is vital for those applications to track, store and scatter provenance information that mirrors their source data and introduced tasks. We present the RDF information global positioning framework. Provenance information is followed during the progress cycle and oversaw multiple times. From that point, this data is appropriated utilizing of this concept URIs. The proposed design depends on the Harvard Library Database. The tests were performed on informational indexes with changes made to the qualities??In the RDF and the subtleties related with the provenance. The outcome has quieted the guarantee as in it pulls in record wholesalers to make significant realities that develop while taking almost no time and exertion.

show abstract