Titlebook: Web-Age Information Management. WAIM 2010 Workshops; WAIM 2010 Internatio Heng Tao Shen,Jian Pei,Jie Shao Conference proceedings 2010 Sprin

開頭

XRCJ: Supporting Keyword Search in XML and Relation Co-occurrencenverted index and design a mixed inverted index. Through conducting extensive experiments on synthetic data from real data set DBLP, we find that our method can achieve a good performance in XML and relation co-occurrence circumstance.

有角

豐滿有漂亮

acetylcholine

HyperGraphDB: A Generalized Graph Databasetomatically reifies every entity expressed in the database thus removing many of the usual difficulties in dealing with higher-order relationships. An open two-layered architecture of the data organization yields a highly customizable system where specific domain representations can be optimized whi

極小量

Survey of Graph Database Performance on the HPC Scalable Graph Analysis Benchmarkecent years, it has become necessary to implement efficient graph databases that can load and manage these huge datasets..In this paper, we evaluate the performance of four of the most scalable native graph database projects (Neo4j, Jena, HypergraphDB and DEX). We implement the full HPC Scalable Gra

減至最低

A Model for Automatic Generation of Multi-partite Graphs from Arbitrary Data a model is to be the formal basis behind a tool for automatic graph generation that we are developing. This tool will automatically generate the basic multi-partite graphs that represents the arbitrary data provided as input..We consider input data as collections of complex objects composed by a se

saturated-fat

A Fast Two-Stage Algorithm for Computing SimRank and Its Extensions famous algorithm to measure objects’ similarities based on link structure. We observe that if one node has no ., similarity score between this node and any of the others is always zero. Based on this observation, we propose a new algorithm, fast two-stage .(.), which can avoid storing unnecessary z

kindred

Hotspot District Trajectory Predictionnematical models to approximate real world routes and always ignore spatial and temporal distance. In order to overcome the drawbacks of existing TP approaches, this study proposes a new trajectory prediction algorithm, called . (.otspot .istinct .rajectory .rediction). It works as: (1) mining the h

PAGAN

Effective XML Keyword Search through Valid Lowest Information Unitest Common Ancestor (LCA) of keyword match nodes. There are also techniques for removing redundant and irrelevant search results. However, the problem of whether a LCA fragment contains complete information has not been adequately investigated. To address this challenge, we first introduce the notio

Awning

Reducing Redundancy of XPath Query over Networks by Transmitting XML Viewsre a large number of optimization techniques on XML applications at home and abroad, including axis join queries, query rewriting, the semantic cache using in the client, redundancy elimination based on marked suffix tree (MST) and so on. However, these techniques are lack of research to eliminate r