The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As a fundamental problem, reach ability query has been always the research emphasis in many applications in the near 20 years. Especially with the coming of the big data era, its efficiency plays a critical role. Although there are many research results for this issue, they all reach a scalability bottleneck. In this paper, we propose an index structure utilizing community center, i.e. to select a...
It is very common that we can find edge-labeled graphs in many applications. And one of the most important issues is regular expression-based reachability query, i.e., to test if one vertex u has a path to another vertex v and the path labels are constrained by a regular expression. Exiting indices for processing classic reachability queries are not fit for processing this kind of operation. In this...
The shortest path distance computing between any two vertices in large scale graphs is an essential problem, e.g., social network analysis, route planning in road map, and has been studied over the past few decades. To answer the query efficiently, the index is widely used. However, when it comes to large scale graphs composed of millions of vertices and edges, they suffer from drawbacks of scalability...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.