Computing a minimum biclique cover is polynomial for bipartite domino-free graphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Co-clustering documents and words using bipartite spectral graph partitioning
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Correlating multilingual documents via bipartite graph modeling
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Bloom Filter-Based XML Packets Filtering for Millions of Path Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Relevance search and anomaly detection in bipartite graphs
ACM SIGKDD Explorations Newsletter
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Co-clustering Documents and Words Using Bipartite Isoperimetric Graph Partitioning
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Knowledge and Data Engineering
Web video topic discovery and tracking via bipartite graph reinforcement model
Proceedings of the 17th international conference on World Wide Web
Context-aware query suggestion by mining click-through and session data
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Anonymizing bipartite graph data using safe groupings
Proceedings of the VLDB Endowment
Query clustering using click-through graph
Proceedings of the 18th international conference on World wide web
Efficient Indices Using Graph Partitioning in RDF Triple Stores
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
A generalized Co-HITS algorithm and its application to bipartite graphs
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A Bipartite Graph Framework for Summarizing High-Dimensional Binary, Categorical and Numeric Data
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
| Hi-index | 0.01 |
Bipartite graphs are widely used to model social networks and web data. However bipartite graph data management (BGDM for short) is not fully studied. Without appropriate indexing structures, query and analysis operations on bipartite graphs are not efficient. In this paper, we raise the issues of BGDM and present architecture of BGDM. Then we propose a logic graph structure (i.e., star) for indexing bipartite graph to improve common operations efficiently. Furthermore, we propose a star-based block structure to store bipartite graphs and the relevant query algorithm. The star-based method may avoid loading the whole block for vertex queries using Bloom filter. Finally, our experiments show that the block design is effective and feasible for vertex query algorithm.