arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.06401cs.HCcs.DBcs.DS
收藏

graphVizdb:一个可扩展的交互式大型图形可视化平台

graphVizdb: A Scalable Platform for Interactive Large Graph Visualization

Nikos Bikakis, John Liagouris, Maria Krommyda, George Papastefanatos, Timos Sellis

摘要:

我们提出了一个新的平台非常大的图形的交互式可视化。该平台使用户能够以与在多个级别上探索地图非常相似的方式与可视化图形进行交互。我们的方法涉及到一个离线预处理阶段,通过分配坐标到它的节点相对于欧几里德平面的图形的布局。各个点用空间数据结构索引,即,R树,并存储在数据库中。基于各种标准的图的多个抽象层也是离线创建的,并且它们被类似地索引,以便用户可以根据其特定需求以不同的粒度级别探索数据集。然后,我们的系统将用户操作转换为简单且非常有效的空间操作(即,窗口查询)。这种技术允许以极低的延迟和内存要求对非常大的图形进行细粒度访问,并且不会影响工具的功能。我们的基于Web的原型支持三个主要操作:(1)交互式导航,(2)多层次的探索,(3)关键字搜索的图元数据。

英文摘要:

We present a novel platform for the interactive visualization of very large graphs. The platform enables the user to interact with the visualized graph in a way that is very similar to the exploration of maps at multiple levels. Our approach involves an offline preprocessing phase that builds the layout of the graph by assigning coordinates to its nodes with respect to a Euclidean plane. The respective points are indexed with a spatial data structure, i.e., an R-tree, and stored in a database. Multiple abstraction layers of the graph based on various criteria are also created offline, and they are indexed similarly so that the user can explore the dataset at different levels of granularity, depending on her particular needs. Then, our system translates user operations into simple and very efficient spatial operations (i.e., window queries) in the backend. This technique allows for a fine-grained access to very large graphs with extremely low latency and memory requirements and without compromising the functionality of the tool. Our web-based prototype supports three main operations: (1) interactive navigation, (2) multi-level exploration, and (3) keyword search on the graph metadata.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑