Abstract
At present, many kinds of databases are widely used in Web applications. When Search Engines find tens of thousands of results for a keyword, it’s very important to spit out and display the results in multiple pages quickly and efficiently instead of just putting them all in one long page. This paper firstly presents several kinds of pagination algorithms based-on Large Data Sets which belongs to the database-driven method. Then, we will experiment on the large data sets and discuss different pagination approaches. The experimental results show that proc_Rownumber() method can greatly improve the performance on the query speed of the pagination.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Paging (Web), http://en.wikipedia.org/wiki/Pagination_web
Mikheevc, O.: Ajax programming with Struts 2. Network World (2009)
Baptiste, L.: Perfect PHP Pagination. SitePoint (2009)
Gervasio, A.: Previous or Next? Paginating Records with PHP-Part 3. Developer Shed (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, J., Wang, W., Shu, Y. (2011). Comparison of Pagination Algorithms Based-on Large Data Sets. In: Qi, L. (eds) Information and Automation. ISIA 2010. Communications in Computer and Information Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19853-3_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-19853-3_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19852-6
Online ISBN: 978-3-642-19853-3
eBook Packages: Computer ScienceComputer Science (R0)