Sciweavers

18 search results - page 1 / 4
» Top-K Correlation Sub-graph Search in Graph Databases
Sort
View
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
13 years 10 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
14 years 3 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 5 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 8 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 5 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...