Sciweavers

404 search results - page 10 / 81
» Correlation search in graph databases
Sort
View
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 10 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 10 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...
VLDB
1998
ACM
144views Database» more  VLDB 1998»
14 years 25 days ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
14 years 2 months ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang
VLDB
2004
ACM
138views Database» more  VLDB 2004»
14 years 1 months ago
ObjectRank: Authority-Based Keyword Search in Databases
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containin...
Andrey Balmin, Vagelis Hristidis, Yannis Papakonst...