Efficient sampling strategies for relational database operations
ICDT Selected papers of the 4th international conference on Database theory
Speed-dependent automatic zooming for browsing large documents
UIST '00 Proceedings of the 13th annual ACM symposium on User interface software and technology
Hierarchical faceted metadata in site search interfaces
CHI '02 Extended Abstracts on Human Factors in Computing Systems
CLARANS: A Method for Clustering Objects for Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
Simple Random Sampling from Relational Databases
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Dynamic sample selection for approximate query processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Automatic construction of multifaceted browsing interfaces
Proceedings of the 14th ACM international conference on Information and knowledge management
Tag clouds for summarizing web search results
Proceedings of the 16th international conference on World Wide Web
Supporting ranking and clustering as generalized order-by and group-by
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Addressing diverse user preferences in SQL-query-result navigation
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Probabilistic ranking of database query results
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
DataScope: viewing database contents in Google Maps' way
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Minimum-effort driven dynamic faceted search in structured databases
Proceedings of the 17th ACM conference on Information and knowledge management
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Data clouds: summarizing keyword search results over structured data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Using trees to depict a forest
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, there may be many pages of data to browse. Since results comprise tuples of alphanumeric values that have few visual markers, it is hard to browse the data quickly, even if it is sorted. In this paper, we describe the design of a system for browsing relational data by scrolling through it at a high speed. Rather than showing the user a fast changing blur, the system presents the user with a small number of representative tuples. Representative tuples are selected to provide a "good impression" of the query result. We show that the information loss to the user is limited, even at high scrolling speeds, and that our algorithms can pick good representatives fast enough to provide for real-time, high-speed scrolling over large datasets.