2859 search results - page 427 / 572 » Querying Complex Structured Databases |
141
Voted
CIKM
2010
Springer
15 years 28 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
163
Voted
SRDS
1998
IEEE
15 years 6 months ago
1998
IEEE
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
103
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
132
Voted
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
We describe the architecture of a hypertext resource discovery system using a relational database. Such a system can answer questions that combine page contents, metadata, and hyp...
145
Voted
BMCBI
2004
15 years 2 months ago
2004
Background: The increasing complexity of genomic data presents several challenges for biologists. Limited computer monitor views of data complexity and the dynamic nature of data ...