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.
Filters
Recent Developments on Insertion-Deletion Systems
2010
Computer Science Journal of Moldova
Preserved Fulltext
systems and their extensions with the graph-control. ...
This article gives an overview of the recent developments in the study of the operations of insertion and deletion. ...
One-sided insertion-deletion systems were firstly considered in [26] and the graph-controlled variant in [21] . ...
doaj:fa9f8dbcebea4001bf07cff6f519f823
fatcat:mlkrca4nmzguflgoehpeslyz7e
Managing and querying multi-version XML data with update logging
2002
Proceedings of the 2002 ACM symposium on Document engineering - DocEng '02
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.
With the increasing popularity of storing content on the WWW and intranet in XML form, there arises the need for the control and management of this data. ...
This paper proposes a version management system for XML data that can manage and query changes in an effective and meaningful manner. ...
This operation inserts insertedpath after subtree t such that it has a final element index i.
Delete: This operation is the inverse of the Insert operations. That is, path! ...
doi:10.1145/585072.585073
fatcat:sshfk7sfuramtixyu6gkroxrei
Managing and querying multi-version XML data with update logging
2002
Proceedings of the 2002 ACM symposium on Document engineering - DocEng '02
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.
With the increasing popularity of storing content on the WWW and intranet in XML form, there arises the need for the control and management of this data. ...
This paper proposes a version management system for XML data that can manage and query changes in an effective and meaningful manner. ...
This operation inserts insertedpath after subtree t such that it has a final element index i.
Delete: This operation is the inverse of the Insert operations. That is, path! ...
doi:10.1145/585058.585073
dblp:conf/doceng/WongL02
fatcat:5epd4xeetfbqtivud4xkwqpife
Efficient instrumentation for code coverage testing
2002
Software engineering notes
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 2016; you can also visit the original URL.
The file type is application/pdf.
Evaluation of Code Coverage is the problem of identifying the parts of a program that did not execute in one or more runs of a program. ...
In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of code coverage. ...
However, with complex control flow graphs and many executed paths, the path-profiling algorithm requires many counters. ...
doi:10.1145/566185.566186
fatcat:kkch7ej23jahnbthejxzzpl6l4
Efficient instrumentation for code coverage testing
2002
Software engineering notes
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 2016; you can also visit the original URL.
The file type is application/pdf.
Evaluation of Code Coverage is the problem of identifying the parts of a program that did not execute in one or more runs of a program. ...
In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of code coverage. ...
However, with complex control flow graphs and many executed paths, the path-profiling algorithm requires many counters. ...
doi:10.1145/566172.566186
dblp:conf/issta/TikirH02
fatcat:5seweskimzab5bignavyugejy4
Efficient instrumentation for code coverage testing
2002
Software engineering notes
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 2016; you can also visit the original URL.
The file type is application/pdf.
Evaluation of Code Coverage is the problem of identifying the parts of a program that did not execute in one or more runs of a program. ...
In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of code coverage. ...
However, with complex control flow graphs and many executed paths, the path-profiling algorithm requires many counters. ...
doi:10.1145/566171.566186
fatcat:f5yzchlau5egvmo3hrnrdiqmsu
MACE
2014
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14
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 then present an approach based on program analysis to check for authorization state consistency in a web application. ...
MACE works on large codebases, and discovers serious, previously unknown, vulnerabilities in 5 out of 7 web applications tested. ...
The obvious one is that this could be intended behavior, i.e., DELETES may have different permissions from Inserts. The actual context on the INSERT could be incorrect. ...
doi:10.1145/2660267.2660337
dblp:conf/ccs/MonshizadehNV14
fatcat:73wxlce4ynhvrnwrwufyxborny
Confluently Persistent Tries for Efficient Version Control
2009
Algorithmica
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 2010; you can also visit the original URL.
The file type is application/pdf.
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. ...
between two arbitrary versions, adding a new child to an existing node, and deleting an existing subtree in an arbitrary version. ...
Acknowledgments We thank Patrick Havelange for initial analysis of and experiments with version control systems such as Subversion. ...
doi:10.1007/s00453-008-9274-z
fatcat:orf3dqi3drbpdibngvndpdg5ru
Don't be a Pessimist: Use Snapshot based Concurrency Control for XML
2006
22nd International Conference on Data Engineering (ICDE'06)
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 replace operator has the effect of a combined delete and insert. ...
Inserting a node or subtree creates valid timestamps at the inserted nodes, deleting a node or subtree adds invalid timestamps to the nodes. ...
doi:10.1109/icde.2006.51
dblp:conf/icde/SardarK06
fatcat:nheka3cdf5hvrcjx6wdao3p7m4
An Access Control Model for Tree Data Structures
[chapter]
2002
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 2005; you can also visit the original URL.
The file type is application/pdf.
For instance, file systems are structured into trees and XML documents can be represented by trees. There are literally as many access control schemes as there are tree data structures. ...
Consequently, an access control model which has been defined for a particular kind of tree cannot be easily adapted to another kind of tree. ...
, we apply the following algorithm: Write (Insert,Delete,Update) Control Algorithm 1. Let S be the user performing the operation which requires the WRITE 1 privilege on node N. 2. ...
doi:10.1007/3-540-45811-5_9
fatcat:yy7ogxgblbh75jsbairunosphe
The information management system IMS/VS, Part III: Batch processing facilities
1977
IBM Systems Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
If one or more SSAs are speci- fied, the system retrieves one or more segments on the first path following the current position that satisfies the SSAs. ...
Segments and paths of Ap data bases may be deleted with the Delete (DLET) function. ...
doi:10.1147/sj.162.0123
fatcat:o4u27blzazdjjmxdu73qd4rbza
Efficient online computation of statement coverage
2005
Journal of Systems and Software
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.
Evaluation of statement coverage is the problem of identifying the statements of a program that execute in one or more runs of a program. ...
In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of statement coverage measurement. ...
However, with complex control flow graphs and many executed paths, the path-profiling algorithm requires many counters. ...
doi:10.1016/j.jss.2004.12.021
fatcat:m6x3ytlg4bfwznsxwumklhbf3u
Design and implementation of a parallel priority queue on many-core architectures
2012
2012 19th International Conference on High Performance 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 2017; you can also visit the original URL.
The file type is application/pdf.
By allowing wide heap nodes to enable thousands of simultaneous deletions of highest priority items and insertions of new items, and taking full advantage of CUDA's data parallel SIMT architecture, we ...
In this paper, aiming at fine-grained applications, we develop an efficient parallel heap system employing CUDA. ...
This system is more efficient than the conventional binary heap system as it can combine a pair of consecutive insert and delete operations into one insert-delete operation. ...
doi:10.1109/hipc.2012.6507490
dblp:conf/hipc/HeAP12
fatcat:l3yvxramknek7hzqgy6fhu2jba
An enhanced concurrency control scheme for multi-dimensional index structures
2001
Proceedings Seventh International Conference on Database Systems for Advanced Applications DASFAA 2001 DASFAA-01
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.
For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on M I D A S -m that is a storage system of a B A D A -m DBMS. ...
In this paper, we propose an enhanced concurrency control algorithm that minimizes the query delay effkiently. ...
database system and so on. ...
doi:10.1109/dasfaa.2001.916379
dblp:conf/dasfaa/SongKY01
fatcat:4znn4nynrfa5rgsjwwbl5dx5em
Approximation for the Path Complexity of Binary Search Tree
[article]
2014
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 2019; you can also visit the original URL.
The file type is application/pdf.
We have analyzed the path complexity of the class BST based on the algorithms for insert and delete operations. ...
Additionally, we have modified the delete operation to minimize the path complexity for the class BST. ...
If we make an insert or delete operation on a state then we have only one state, i.e. if insert than state + 1 or if delete then state − 1. ...
arXiv:1404.4692v1
fatcat:zm7pbdb6mrbibabilpbzvuikfu
« Previous
Showing results 1 — 15 out of 74,659 results