Sciweavers

74 search results - page 2 / 15
» Fast incremental proximity search in large graphs
Sort
View
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 7 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 10 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
GIS
2007
ACM
14 years 6 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
PUK
2000
13 years 7 months ago
4SP: A four stage incremental planning approach
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
Eva Onaindia, Laura Sebastia, Eliseo Marzal
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 7 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...