Sciweavers

469 search results - page 2 / 94
» Survey of graph database models
Sort
View
BIRTHDAY
2010
Springer
13 years 6 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
TOOLS
2000
IEEE
13 years 10 months ago
Spatiotemporal Data Modeling and Management: A Survey
Many data objects in the real world have attributes about location and time. Such spatiotemporal objects can be found in applications such Geographic Information Systems (GIS), env...
Xiaoyu Wang, Xiaofang Zhou, Sanglu Lu
VLDB
1994
ACM
115views Database» more  VLDB 1994»
13 years 9 months ago
Database Graph Views: A Practical Model to Manage Persistent Graphs
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
Alejandro Gutiérrez, Philippe Pucheral, Her...
MFCS
1992
Springer
13 years 9 months ago
The Complexity of Graph Connectivity
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Avi Wigderson
UAI
2003
13 years 7 months ago
Renewal Strings for Cleaning Astronomical Databases
Large astronomical databases obtained from sky surveys such as the SuperCOSMOS Sky Surveys (SSS) invariably suffer from spurious records coming from artefactual effects of the t...
Amos J. Storkey, Nigel C. Hambly, Christopher K. I...