基于图形的动态信息查询系统

本文以集输工艺流程动态查询系统为例,讨论了一种利用ＰｏｗｅｒＢｕｉｌｄｅｒ快速开发基于图形的动态数据查询软件的设计方案。     

演绎数据库中语义查询的动态优化算法

演绎数据库的语义查询优化是利用数据库中的完整性约束,将用户提交的查询转换为与原查询等价且执行效率更高的查询规则。该文提出的动态语义优化算法在查询计算过程中动态约去存在的空展开式,使得查询时间开销的节省可用所除去的空展开式规模大小衡量,较适用于含有大量空展开式的演绎数据库。     

演绎数据库中语义查询的动态优化算法

演绎数据库的语义查询优化是利用数据库中的完整性约束,将用户提交的查询转换为与原查询等价且执行效率更高的查询规则。该文提出的动态语义优化算法在查询计算过程中动态约去存在的空展开式,使得查询时间开销的节省可用所除去的空展开式规模大小衡量,较适用于含有大量空展开式的演绎数据库。     

动态模糊查询设计

文中从三方面介绍了如何在多目标、多因素、多条件下实现动态模糊及全方位综合查询.首先,从散列和树型两种结构提出模型设计;其次,从动态和随机处理介绍输出设计;最后,从通用和数据库角度阐述编程设计,旨在提高系统设计、研发、编程水平和软件质量.     

公交线路查询算法

公共交通不仅是衡量城市现代化程度的重要标志也是解决交通拥堵问题的途径. 而公交线路查询系统的关键技术是公交线路查询算法, 它对提高公交资源的利用率有着重要的意义. 总结了国内外城市公交最优路径算法并在此基础上分析了高效运行城市公交系统的条件和影响因素. 介绍了最短路径问题及Dijkstra算法及其在查询系统应用中的弊端. 然后提出了基于换乘最小的广度优先算法的数学模型, 给出了算法的实现, 并以银川市公共交通公司的公交部分数据为基础, 完成了公交信息查询系统的设计与开发.     

一种面向动态连续查询的查询索引

针对当前面向连续查询的查询索引不适应查询动态变化的问题,提出一种能承受频繁更新的动态连续查询索引。为实现该索引,设计一种基于网格和树的索引结构,该索引结构继承了网格结构的高效更新性能的优点,并通过继承树的特性,克服网格结构高空间开销的问题。实验结果表明,该连续查询索引比基于网格的连续查询索引节省空间开销约一个数量级;比基于树的连续查询索引更新效率提高约70%,查询性能提高约25%。     

基于网格服务的半连接查询优化算法研究

随着网格计算技术的快速发展,其应用领域在不断扩大,然而,跨网络分布式数据的联合查询往往成为性能的瓶颈,因此文中从提高分布式数据的联合查询的效率出发,以网格计算这一新型web体系结构为技术平台,研究基于网格服务的查询优化目标、查询优化对象和查询优化策略。文中采用了应用非常广泛的启发式搜索算法来缩小策略空间这一优化策略,并在该策略的基础上提出了一种基于网格服务的2-way半连接查询优化算法,最后在网格计算环境下对该算法与一般的全连接算法做了实验对比,证明基于网格服务的2-way半连接查询优化算法可大大缩短查询响应时间。     

一种支持模糊查询的LINQ动态查询方案

LINQ（.NET Language Integrated Query）已经成为.NET Framework下的一项主流技术,但运用其动态查询的人却很少,因为目前的几种实现技术都存在各自的缺陷,为此,给出了一种支持模糊查询的LINQ动态查询方案。该方案在遵循LINQ规范的前提下,避免了使用复杂、易受注入攻击、不支持模糊查询等缺陷。该方案与查询对象及其属性无关,因此是真正的动态查询方案。     

基于主从表的动态查询技术

信息查询是数据库应用系统最重要的工作之一。在涉及多表联接查询时,有多种解决方案。本文在Query静态主从表技术的基础上,采用Query主从表的动态联接技术,便捷、高效地实现多表联接的动态查询。     

A new approach to rectangle intersections part I

Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient in time and space and allows us to report all d-dimensional rectangles stored which intersect a d-dimensional query rectangle. Second, in Part II, a slightly modified version of this new data structure is applied to report all intersecting pairs of rectangles of a given set. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.     

An optimal time and minimal space algorithm for rectangle intersection problems

Given a set ofn iso-oriented rectangles in the plane whose sides are parallel to the coordinate axes, we consider the rectangle intersection problem, i.e., finding alls intersecting pairs. The problem is well solved in the past and its solution relies heavily on unconventional data structures such as range trees, segment trees or rectangle trees. In this paper we demonstrate that classical divide-and-conquer technique and conventional data structures such as linked lists are sufficient to achieve a time bound ofO(n logn) +s, and a space bound of (n), both of which are optimal.Supported in part by the National Science Foundation under Grants MCS 8342682 and ECS 8340031.     

Finding the maximum bounded intersection of k out of n halfplanes

In this note we study the following question: Given n halfplanes, find the maximum-area bounded intersection of k halfplanes out of them. We solve this problem in O(n³k) time and O(n²k) space.     

Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines

We develop efficient algorithms for a number of generalized intersection reporting problems, including orthogonal and general segment intersection, 2D range searching, rectangular point enclosure, and rectangle intersection search. Our results for orthogonal and general segment intersection, 3-sided 2D range searching, and rectangular pointer enclosure problems match the lower bounds for their corresponding standard versions under the pointer machine model. Our results for the remaining problems improve upon the best known previous algorithms.     

A new algorithm for the largest empty rectangle problem

A rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle problem, i.e., the problem of finding a maximum area rectangle contained inA and not containing any point ofS in its interior. The computational complexity of the presented algorithm isO(n logn + s), where s is the number of possible restricted rectangles considered. Moreover, the expected performance isO(n · logn).     

Fast dynamic intersection searching in a set of isothetic line segments

We reconsider the (isothetic) line segment intersection searching problem: Given a set S of n horizontal and vertical line segments and a query segment q, find all t segments in S intersecting q. We describe the first dynamic solution for this problem which achieves O(log n + t) query time. This, however, has to be paid by O(n log² n) space requirements and O(log³ n) update time. If segments are defined over a grid of size N × N (the semidynamic case), then the problem can be solved in O(logN + t) query time, O(n log² N) space and O(log² N) update time. The solution is based on the use of segment tree and range tree and the halfobject technique.     

Quasi-optimal upper bounds for simplex range searching and new zone theorems

This paper presents quasi-optimal upper bounds for simplex range searching. The problem is to preprocess a setP ofn points in ^d so that, given any query simplexq, the points inP q can be counted or reported efficiently. Ifm units of storage are available (n <m <n ^d ), then we show that it is possible to answer any query inO(n ¹⁺/m ^1/d ) query time afterO(m ¹⁺) preprocessing. This bound, which holds on a RAM or a pointer machine, is almost tight. We also show how to achieveO(logn) query time at the expense ofO(n ^d+) storage for any fixed > 0. To fine-tune our results in the reporting case we also establish new zone theorems for arrangements and merged arrangements of planes in 3-space, which are of independent interest.A preliminary version of this paper has appeared in theProceedings of the Sixth Annual ACM Symposium on Computational Geometry, June 1990, pp. 23–33. Work on this paper by Bernard Chazelle has been supported by NSF Grant CCR-87-00917 and NSF Grant CCR-90-02352. Work on this paper by Micha Sharir has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grants DCR-83-20085 and CCR-8901484, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD—the Israeli National Council for Research and Development, and the Fund for Basic Research administered by the Israeli Academy of Sciences. Work by Emo Welzl has been supported by Deutsche Forschungsgemeinschaft Grant We 1265/1–2. Micha Sharir and Emo Welzl have also been supported by a grant from the German-Israeli Binational Science Foundation. Last but not least, all authors thank DIMACS, an NSF Science and Technology Center, for additional support under Grant STC-88-09648.     

Orthogonal queries in segments

We consider theorthgonal clipping problem in a set of segments: Given a set ofn segments ind-dimensional space, we preprocess them into a data structure such that given an orthogonal query window, the segments intersecting it can be counted/reported efficiently. We show that the efficiency of the data structure significantly depends on a geometric discrete parameterK named theProjected-image complexity, which becomes Θ(n ²) in the worst case but practically much smaller. If we useO(m) space, whereK log^4d−7 n≥m≥n log^4d−7 n, the query time isO((K/m)^1/2 log^{max{4, 4d−5}} n). This is near to an Ω((K/m)^1/2) lower bound.     

A strong lower bound for approximate nearest neighbor searching

We prove a lower bound of d^1−o(1) on the query time for any deterministic algorithms that solve approximate nearest neighbor searching in Yao's cell probe model. Our result greatly improves the best previous lower bound for this problem, which is [A. Chakrabarti et al., in: Proc. 31st Ann. ACM Symp. Theory of Computing, 1999, pp. 305-311]. Our proof is also much simpler than the proof of A. Chakrabarti et al.