The case for a wide-table approach to manage sparse relational data sets

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 821-832

  Chu, Eric ^a   Beckmann, Jennifer ^b   Naughton, Jeffrey ^a  

^a University of Wisconsin Madison   (United States)

^b MICROSOFT   (United States)

Author keywords

Relational; Sparse data; Wide table

Indexed keywords

DATA MINING; DATA STRUCTURES; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; QUERY PROCESSING;

SCHEMA DESIGN; SELF-MANAGING DATABASE SYSTEMS; SPARSE DATA SETS;

RELATIONAL DATABASE SYSTEMS;

EID: 35448971511     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247571     Document Type: Conference Paper

References (21)

1. D. Abadi. Redefining Physical Data Independence. To appear in CIDR 2007.
2. E. Agichtein, L. Gravano: Querying Text Databases for Efficient Information Extraction. ICDE 2003: 113-124.
3. R. Agrawal, A. Somani, and Y. Xu. Storage and querying of e-commerce data. In Proc. of VLDB, pages 149-158, 2001.
4. R. Agrawal, R. Srikant. Searching with Numbers. WWW2002.
5. R. Baylis. Oracle Database Administrator's Guide, 10g, 2003.
6. J. L. Beckmann, A. Halverson, R. Krishnamurthy, and J. F. Naughton. Extending RDBMSs to support sparse datasets using an interpreted, attribute storage format. In Proc. of ICDE, 2006.
7. th national conference, pg. 273-283, USA, 1969. ACM Press.
8. S. Chaudhuri, V. Narasayya. An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. In VLDB, 1997.
9. CLUstering TOolkit (CLUTO). WWW, available at: http://www.cs.umn.edu/ karypis/cluto.
10. CNET Networks, Inc. Product Directory. http://shoppper.cnet.com.
11. J. Edmonds, J Gryz, D. Liang, R. Miller. Mining for Empty Rectangles in Large Data Sets. ICDT 2001: 174-188.
12. D. Florescu, D. Kossmann, I. Manolescu, "Integrating Keyword Search into XML Query Processing", WWW Conf., 2000.
13. V. Hristidis and Y. Papakonstantinou. Discover: Keyword search in relational databases. In Proc. of VLDB, 2002.
14. Y. Li, C. Yu, H. Jagadish. Schema-Free XQuery. In VLDB, 2004.
15. D. Maier, J. Ullman. Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst., 1983.
16. S. Navathe, S. Ceri, G. Wiederhold, and J. Dou. Vertical Partitioning Algorithms for Database Design. ACM Trans. Database Syst., 9(4):680-710, 1984.
17. D. Pyle. Data preparation for data mining. Morgan Kaufmann Publishers Inc., 1999.
18. E. Rahm, P. A. Bernstein, A survey of approaches to automatic schema matching. VLDB Journal 10, 4 (Dec. 2001), pp. 334-350.
19. R. Raman, M. Livny, and M. H. Solomon. Matchmaking: Distributed resource management for high throughput computing. In HPDC, 1998.
20. M. Stonebraker et al. C-Store: a Column-Oriented DBMS. In VLDB 2005.
21. M. Stonebraker. The Case for Partial Indexes. SIGMOD Rec., 18(4):4-11, 1989.