Web数据库分页浏览方法性能分析

随着互联网的发展,Web数据库的应用越来越多,在Web页面中实现数据库记录的分页显示是一项复杂而又实用的技术。Web数据库分页有基于ADO的分页和存储过程分页2种方法。从Web数据查询特点出发,对这2种方法的性能进行了分析,并且着重介绍了存储过程分页的实现方法以及表变量在存储过程中的应用,最后对这2种Web数据库分页浏览的方法进行了测试和比较。结果表明,利用存储过程分页可以有效地提高Web数据访问的效率。     

Django框架Web数据查询分页技术研究

为了探索Django框架下Web数据查询分页的实现方法及性能,本文先对Web数据查询分页的执行过程和在其它框架下常用的分页方法进行了分析研究.在此基础上,提出了在Web服务层和在数据库服务层分页两种方案在Django框架下实现的几种具体方法,分别是利用缓存和Sessions实现在Web服务层分页,利用存储过程和自定义Manager方法实现在数据库服务层分页.最后,对这几种实现方法进行了测试比较,发现在网站数据量较小时几种方法性能差别不大,当数据量较大时在数据库服务层分页方法性能较为优越.     

基于XQuery查询的表格数据分页的实现

针对Web应用系统中对表格数据分页显示的需求,简要介绍了利用GridView控件的内置分页技术实现分页的方法,提出并实现了一种利用XQuery查询实现装备保障信息综合管理系统中表格数据的分页显示的方法。     

浅析Asp.Net中常用的数据分页技术

分页是Web应用程序中最常用到的功能之一。在对海量数据的访问中,它是提高用户数据访问速度的主要手段。在WEB应用中,对数据的查询往往会出现大量的符合条件的查询结果,而查询大量的数据并传输非常耗时,也影响界面美观。本文介绍了Asp.Net中常用的数据分页技术,包括PageDataSource分页、gridview自带的分页方式、存储过程分页方式、LINQ代码动态构建语句分页及AspNetPager控件分页等。     

Web数据挖掘技术探讨

Web挖掘是在传统数据挖掘技术的基础上产生的,是从Web上的数据中发现用户的浏览模式或寻找相关的Web页面等。本文首先介绍了Web挖掘的一般知识,然后分析了Web数据挖掘的常用技术,最后讨论了该技术在各领域的应用。     

XML数据岛结合AJAX实现Web的异步刷新

数据岛作为HTML文档的一种交互手段,它通过特定的标记将XML元素嵌入到HTML页面中,能够很好地展示和更新信息。网络的响应速度是Web应用开发的关键,AJAX作为一种新的应用程序技术,在Web应用程序开发中有独特的优势,本文通过实例结合AJAX．NET和XML数据岛技术实现Web页面的异步刷新,实验表明,在Web应用程序开发过程中,使用AJAX技术能降低网络负载,提高数据访问速度。     

MongoDB数据库分页技术优化探析

通过分析内置skip-limit MongoDB数据分页方法的优缺点,以及影响数据分页速度的关键因素,提出了一种数据分页方法,改变查询文档的规则,使用合理的索引,可以提高数据分页的效率,实验结果验证了优化后的查询结果.     

DataView在Web数据库查询上的应用

DataView是ADO .NET对象群中一个重要的成员 ,它可以用于一般的Web数据库查询 ,也可以和其它控件结合起来实现高级的Web数据库查询以及查询结果的分页显示。本文通过实例介绍了DataView在Web数据库查询上的各种应用。这些实例在开发Web数据库应用系统中很有实用价值     

新书预告

这是一本讲解如何把Word文件转成精美的Web页的书籍,书中大量的经验、技巧使您不会再对Web页望而生畏。具体内容包括:Web基础知识,连入Inter-net的六种方案,建立Web站的各种方法,创建Web页的技巧与理论,以及有关创建Web页的更深的课程及练习。同时还有一张包括大量模板、图片和软件的CD-ROM。     

一种通用XML数据岛动态生成和数据绑定方法

为了减少网页访问时网络的负载,采用XML数据岛技术实现网页中数据的处理.介绍XML数据岛的概念,并讨论Web页中XML数据岛生成和绑定的机制,给出一种使用ASP和ADO技术由数据库动态生成XML数据岛,并动态绑定数据的通用方法,可应用于各种基于Web的应用系统,提高开发效率.     

双向寻呼——寻呼市场的新契机

近年来,中国的无线电寻呼市场发展异常迅猛,但面临着移动电话手机带来的挑战和威胁。双向寻呼的诞生为寻呼服务注入了新的活力,它可实现自动漫游登记、确保消息送达并具有回发消息的功能。它与Ｉｎｔｅｒｎｅｔ连接,能为用户提供别开生面的网络信息服务。     

Internet寻呼业务应用前景可观

随着Ｉｎｔｅｒｎｅｔ网络技术的发展,Ｉｎｔｅｒｎｅｔ用户和寻呼业务用户日益增多,Ｉｎｔｅｒｎｅｔ寻呼业务应运而生,Ｉｎｔｅｒｎｅｔ寻呼业务按使用方法可分为万维网寻呼和电子邮件寻呼两大类,目前提供电子邮件寻呼业务的公司较多。     

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

解决基站丢失寻呼消息的措施

经过对南宁基站丢失寻呼消息相关话务统计数据分析,阐述立即指派对寻呼的影响,以及通过试验修改MFRMS（寻呼复帧）参数确定减小MFRMS可以较大幅度的降低基站丢失寻呼消息的风险,最后指出了必须采取开源节流等优化措施才能从根本上解决CCCH（公共控制信道）拥塞问题,最终解决基站丢失寻呼消息问题。     

Dynamic multi-step paging scheme in PMIPv6-based wireless networks

In Proxy Mobile IP (PMIPv6) networks, proxy-registrations are performed even for idle MNs, resulting in unnecessary signaling traffic. Although there have been many IP paging techniques aimed at reducing the unnecessary location update, they focus only on Mobile IP (MIP) since they had been developed before PMIPv6 was proposed. Thus, adopting existing IP paging support is not sufficient to support mobility in PMIPv6 networks. For more efficient support, we propose a dynamic multi-step paging scheme that pages an MN in multiple incremental steps instead of flooding paging messages to a whole paging area to significantly reduce the signaling traffic caused by the proxy location updates in the PMIPv6 networks. In addition, to improve the paging delay performance that may be deteriorated by the multi-step paging, the proposed scheme configures paging area dynamically to raise the efficiency of locating MNs. The size of a paging area is designed to be determined based on the speed of an MN. We also develop a thorough analytical model for evaluating the performance of the proposed scheme compared with a static paging scheme in terms of the signaling cost and the paging delay. Thorough analysis and simulation demonstrate that in the PMIPv6 network, our paging scheme can significantly reduce the signaling cost for IP paging, achieving a shorter paging delay, compared to that of a paging scheme with a fixed paging area.     

Paging area optimization based on interval estimation in wireless personal communication networks

We consider an optimum personal paging area configuration problem to improve the paging efficiency in PCS/cellular mobile networks. The approach is to set up the boundaries of a one-step paging area that contain the locations of a mobile user with a high probability and to adjust the boundaries to gain a coverage that is matched to the mobile user's time-varying mobility pattern. We formulate the problem as an interval estimation problem. The objective is to reduce the paging signaling cost by minimizing the size of the paging area constrained to certain confidence measure (probability of locating the user), based on a finite number of available location observations of the mobile user. Modeling user mobility as a Brownian motion with the drift stochastic process and by estimating the parameters of the location probability distribution of the mobility process, the effects of the mobility characteristics and the system design parameters on the optimum paging area are investigated. Results show: (1) the optimum paging area expands with the time elapsed after the last known location of the user; (2) it also increases with the length of a prediction interval and the location probability; (3) the relative change in the paging area size decreases with the increase in the number of location observations. This revised version was published online in June 2006 with corrections to the Cover Date.     

Paging area optimization based on interval estimation in wireless personal communication networks

We consider an optimum personal paging area configuration problem to improve the paging efficiency in PCS/cellular mobile networks. The approach is to set up the boundaries of a one-step paging area that contain the locations of a mobile user with a high probability and to adjust the boundaries to gain a coverage that is matched to the mobile user's time-varying mobility pattern. We formulate the problem as an interval estimation problem. The objective is to reduce the paging signaling cost by minimizing the size of the paging area constrained to certain confidence measure (probability of locating the user), based on a finite number of available location observations of the mobile user. Modeling user mobility as a Brownian motion with the drift stochastic process and by estimating the parameters of the location probability distribution of the mobility process, the effects of the mobility characteristics and the system design parameters on the optimum paging area are investigated. Results show: (1) the optimum paging area expands with the time elapsed after the last known location of the user; (2) it also increases with the length of a prediction interval and the location probability; (3) the relative change in the paging area size decreases with the increase in the number of location observations. This revised version was published online in June 2006 with corrections to the Cover Date.