ACM SIGMOD Record
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A domain based internal schema for relational database machines
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A Query Processing Strategy for the Decomposed Storage Model
Proceedings of the Third International Conference on Data Engineering
Storage and Querying of E-Commerce Data
Proceedings of the 27th International Conference on Very Large Data Bases
MIL primitives for querying a fragmented world
The VLDB Journal — The International Journal on Very Large Data Bases
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Integrating compression and execution in column-oriented database systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
The case for a wide-table approach to manage sparse relational data sets
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
iVA-File: Efficiently Indexing Sparse Wide Tables in Community Systems
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
| Hi-index | 0.00 |
The increasing popularity of Community Web Management Systems (CWMSs) calls for tailor-made data management approaches for them. Still, existing CWMSs have mostly focused on simple similaritybased queries; they do not provide a framework for the efficient processing of more complex queries over community web data. In this paper, we propose a two-way indexing scheme that facilitates efficient and scalable retrieval and complex query processing with community data. A thorough experimental comparison, based on real-world data and practical queries, illustrates the advantages of our scheme compared to other approaches for community web data management. Besides, our doubleindexing scheme provides an attractive solution to the storage problem as well.