Sciweavers

237 search results - page 45 / 48
» Querying RDF Data from a Graph Database Perspective
Sort
View
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 7 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
TKDE
2010
160views more  TKDE 2010»
13 years 5 months ago
Using Proximity Search to Estimate Authority Flow
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...
ER
1999
Springer
108views Database» more  ER 1999»
13 years 11 months ago
Modeling Cyclic Change
Database support of time-varying phenomena typically assumes that entities change in a linear fashion. Many phenomena, however, change cyclically over time. Examples include monsoo...
Kathleen Hornsby, Max J. Egenhofer, Patrick J. Hay...
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 7 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...