A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient dynamic range minimum query
2016
Theoretical Computer Science
Preserved Fulltext
We therefore introduce a new trade-off for the dynamic range minimum problem. ...
Example 2 . 2 Let us consider the minimum query in the range [5..9] of S. the minimum query in the range [5..9] retrieves S[9] = 3, but the position 9 is not a 1-local minima of S. ...
doi:10.1016/j.tcs.2016.07.002
fatcat:4fgki5roxfdvzlxsbz4mcl4kii
On (Dynamic) Range Minimum Queries in External Memory
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first spaceoptimal solution to the batched static version of the problem. ...
We also show that an instance of the batched dynamic RMQ problem with N updates and Q queries can be solved in O N +Q B log 2 M/B N +Q B I/O complexity and O(N + Q) space. ...
Conclusions and Open Questions We addressed the problem of static and dynamic batched range minimum queries in external memory and presented several algorithms for solving the problem. ...
doi:10.1007/978-3-642-40104-6_4
fatcat:oksdidq3v5gofdnam5zgyxgx3a
Efficient Dynamic Bloom Filter Hashing Fragmentation for Cloud Data Storage
2019
Cybernetics and Information Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The performance of proposed DBFH-CDS Technique is measured in terms of Execution time and Data retrieval efficiency. ...
In order to overcome such limitations, a Dynamic Bloom Filter Hashing based Cloud Data Storage (DBFH-CDS) Technique is proposed. ...
of range query
Fig. 9 . 9 Measure of Scalar query vs Data retrieval efficiency Fig. 9 exhibits the impact of
Fig. 10 . 10 Measure of Range query vs Data retrieval efficiency
Table 1 . 1 Tabulation ...
doi:10.2478/cait-2019-0003
fatcat:viwtgvs44zfrxcmq5npf37s6xa
A Decentralized Storage Scheme for Multi-Dimensional Range Queries over Sensor Networks
2009
2009 15th International Conference on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a dynamic programming based methodology to control the granularity of the index tree in an optimized approach, and an optimized routing scheme for range query processing to achieve best energy ...
This paper presents the design of a decentralized storage scheme to support multi-dimensional range queries over sensor networks. ...
processing, which cannot be energy efficient for range query processing. ...
doi:10.1109/icpads.2009.24
dblp:conf/icpads/Xie0CX09
fatcat:a52dglvlr5ehjiub4x6svqmcdi
A Novel Interface for Information Exploration and Visualisation
1994
Australasian Journal of Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Specifically, the InfoVis interface enables the user to search a database without the need to create or formulate complex syntactical query statements. ...
The dynamic slider and other widgets are utilized to assist users in mental visualization and representation of objects and actions. ...
The query frame (see Figure 4) linked with a dynamic slider which specifies single range, dynamic range, or ranges in general. ...
doi:10.3127/ajis.v2i1.415
fatcat:27bidfq7kfhd5eloi7dufvlify
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We revisit the range minimum query problem and present a new O(n)-space data structure that supports queries in O(1) time. ...
Although previous data structures exist whose asymptotic bounds match ours, our goal is to introduce a new solution that is simple, intuitive, and practical without increasing costs for query time or space ...
the range minimum query problem. ...
arXiv:1109.4460v1
fatcat:tm65wrer55cwrjrghihaeo6uwi
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
As a by-product, we propose a fully-dynamic data structure for range minimum queries (RmQs) with a constraint where the width of each query range is limited to polylogarithmic. ...
Furthermore, we consider the SUPS problem in the after-edit model and present an efficient algorithm. ...
Furthermore, as a by-product, we propose a fully-dynamic data structure for the range minimum query (RmQ) in which the width of each query range is in O(polylog(n)). ...
arXiv:2204.07327v1
fatcat:ek3tuxrxxzbspefsydlel64lm4
PRoBe: Multi-dimensional Range Queries in P2P Networks
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We also propose load balancing techniques and show how cached query answers can be utilized for the efficient evaluation of similar range queries. ...
These valuable properties also make them a candidate for more complex queries, such as range queries. ...
We will also explore the possibility of implementing a fully dynamic and decentralized tree-like index structure that efficiently supports range queries. ...
doi:10.1007/11581062_25
fatcat:iga67lqwlfesdbznrfpxyamozm
Dynamic tiled map services
2010
Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application - COM.Geo '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The approach includes quadtree-based indexing and query processing at the server side and a middleware to efficiently convert quadrants of dynamic query results into tiled images. ...
Motivated by the practical needs of supporting query-based visual explorations in a Web environment, we have proposed a dynamic tiled map services approach that integrates and extends existing Web-based ...
Note that the min/max values associated with the intermediate quadtree nodes can be used to prune the search space, i.e., if the query value range does not intersect with the range of the minimum/maximum ...
doi:10.1145/1823854.1823877
dblp:conf/comgeo/ZhangY10
fatcat:gtgxcac5wrd6fiz6izb52amkri
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
1992
Proceedings., 33rd Annual Symposium on Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. ...
pair, diameter, and Euclidean minimum spanning tree. ...
In this paper we present efficient solutions to two dynamic geometric problems: halfspace range reporting and finding the minima of a decomposable function. ...
doi:10.1109/sfcs.1992.267816
dblp:conf/focs/AgarwalEM92
fatcat:sowinnkgevawxny6dobkp6va3e
Indexing valid time intervals
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We assume that the temporal information of data objects are represented as valid time intervals that have to be managed dynamically by an efficient index structure. ...
To support temporal operators and to increase the efficiency of temporal queries, indexing based on temporal attributes is required. ...
In the literature, there are also index structures that are build on both key and time dimensions for efficiently answering range-timeslice queries, as well as key-range queries that are purely based on ...
doi:10.1007/bfb0054512
fatcat:b5ara3wl2jhjvmyflp4oflbqxm
DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems
2006
2006 Fifth International Symposium on Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Supporting range query over Peer-to-Peer systems has attracted many research efforts in recent years. ...
DHR-trees enables multidimensional range query to be executed similarly as in overlapping regions tree in P2P systems. ...
Enabling efficient access to distributed and dynamic data is hot research topic in P2P systems. ...
doi:10.1109/ispdc.2006.19
dblp:conf/ispdc/WeiS06
fatcat:cbjcpev3bfeoxd2rwrvmksm2be
An Approach for Efficient and Secure Data Encryption Scheme for Spatial Data
2020
SN Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The experimental assessment shows a more efficient approach towards the dynamic grid structure than the progressive confidentiality technique for uninterrupted location-based services. ...
Fourth, despite these things, it has only been targeted on the range and our system that can effectively support different spatial queries without altering the algorithms that are kept running by the semi-reliable ...
Efficient protocols for dynamic grid structure can also be developed to help for both uninterrupted k-nearest neighbour (NN) and range queries. ...
doi:10.1007/s42979-020-0095-8
fatcat:e3n5yvcn2rfrddvx3bj3nshmja
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We revisit the range minimum query problem and present a new O(n)-space data structure that supports queries in O(1) time. ...
Although previous data structures exist whose asymptotic bounds match ours, our goal is to introduce a new solution that is simple, intuitive, and practical without increasing asymptotic costs for query ...
revisit solutions to the range minimum query problem. ...
doi:10.1007/978-3-642-40273-9_5
fatcat:y5qwp6y57zealni4gapwtlwue4
A Minimum Sequence Matching Scheme for Efficient XPath Processing
2009
KSII Transactions on Internet and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. ...
Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of ...
Therefore, we also propose the efficient minimum sequence matching for a twig query; it only executes the range queries about the leaf nodes and branch nodes of a twig query tree, as is shown in example ...
doi:10.3837/tiis.2009.05.005
fatcat:vyvt23yuljb3rofbqza7wlyu3y
« Previous
Showing results 1 — 15 out of 89,207 results