Sciweavers

9810 search results - page 1895 / 1962
» Problems, Descriptions and Objects
Sort
View
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
15 years 10 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
15 years 10 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
SIGMOD
2007
ACM
195views Database» more  SIGMOD 2007»
15 years 10 months ago
Effective variation management for pseudo periodical streams
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...
Lv-an Tang, Bin Cui, Hongyan Li, Gaoshan Miao, Don...
SIGMOD
2002
ACM
177views Database» more  SIGMOD 2002»
15 years 10 months ago
Coordinating backup/recovery and data consistency between database and file systems
Managing a combined store consisting of database data and file data in a robust and consistent manner is a challenge for database systems and content management systems. In such a...
Suparna Bhattacharya, C. Mohan, Karen Brannon, Ind...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
« Prev « First page 1895 / 1962 Last » Next »