Multiple database updates using paths
作者： Harel Amir , Goldberg Roman , Gottlieb Amit , Rozenwald Guy
DOI:
关键词: Node (networking) 、 Graph database 、 Database 、 Shortest path problem 、 Value (computer science) 、 Computer science
摘要: Systems and methods for multiple updates to a database using paths is disclosed. Updates graph can be performed by associating an attribute node, that stores the updated value, entity node to-be updated. When queried nearest identified shortest path determination.
lens.org 参考文章(11)
James W. Dempsey, Cross process accessibility ,(2011)
Ruoming Jin, Systems, methods, and software for unified analytics environments ,(2013)
Aviv Kuvent, Asaf Levy, Yariv Bachar, Preserving past states of file system nodes ,(2012)
Diego Villarreal, Sean Levy, Pranab Nag, John Fleming, Graph database system and method for facilitating financial and corporate relationship analysis ,(2010)
Dean T. Allemang, Jon S. Anthony, Software composition using graph types, graphs, and agents ,(2001)
Markus K. Cremer, Peter C. Dimaria, Vadim Brenner, Dale T. Roberts, Method and system for media navigation ,(2007)
Toshiyasu Sakata, Takahiko Orita, Eiichi Konno, Ikuo Ohtsuka, Takao Yamaguchi, Wiring design apparatus and method ,(2010)
Vijay S. C Third Floor Magan Silver Joshi, Dharani Karthikeyan, Using attribute inheritance to identify crawl paths ,(2005)
Charles E. Henderson, System and method for creating, deploying, integrating, and distributing ,(2011)
James M. Cochran, William P. Hughes, John C. Hay, User Interface Displaying Hierarchical Data on a Contextual Tree Structure ,(2007)