Sciweavers

71 search results - page 14 / 15
» Call Graph Prefetching for Database Applications
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 1 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
AAAI
2008
14 years 10 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 2 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
High-throughput bioinformatics with the Cyrille2 pipeline system
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
Mark W. E. J. Fiers, Ate van der Burgt, Erwin Date...
86
Voted
PODS
2002
ACM
167views Database» more  PODS 2002»
15 years 9 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon