Filters








26,475 Hits in 7.7 sec

Deleting and Building Sort Out Techniques for Case Base Maintenance [chapter]

Maria Salamó, Elisabet Golobardes
2002 Lecture Notes in Computer Science  
Different criteria to the maintenance task have been used for more than half a century. In this paper we present different sort out techniques for case base maintenance.  ...  Next, we present sort out techniques that build new reduced competent case memories based on the original ones.  ...  Aha for providing the IBL code as well as D. Randall Wilson and Tony R. Martinez who provided the code of the other reduction techniques.  ... 
doi:10.1007/3-540-46119-1_27 fatcat:kkxtm6iasnfzhkunwcalvdh4oq

On Indexing Sliding Windows over Online Data Streams [chapter]

Lukasz Golab, Shaveen Garg, M. Tamer Özsu
2004 Lecture Notes in Computer Science  
Our proposed data structures and query semantics are based on a division of the sliding window into sub-windows.  ...  types of indices: those which provide a list of attribute values and their counts for answering set-valued queries, and those which provide direct access to tuples for answering attribute-valued queries  ...  . • Using the basic window model as a window maintenance technique and as a basis for continuous query semantics, we propose main-memory based storage methods for sliding windows. • We classify relational  ... 
doi:10.1007/978-3-540-24741-8_41 fatcat:ynu6ci542bff5pgxqw2lgvm4w4

Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries

Lei Zou, Lei Chen
2008 2008 IEEE 24th International Conference on Data Engineering  
Based on the cost analysis, we propose the optimization technique, pseudo record, to improve the search efficiency.  ...  In this paper, we investigate the intrinsic connection between top-k queries and dominant relationship between records, and based on which, we propose an efficient layer-based indexing structure, Dominant  ...  Basically, they can be divided into three categories: Sorted list-based, Layer-based and View-based. 1 . Sorted lists-based.  ... 
doi:10.1109/icde.2008.4497462 dblp:conf/icde/ZouC08 fatcat:wrw343cv5zaw5lszdo23fqmuu4

Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems [article]

Chen Luo, Michael J. Carey
2019 arXiv   pre-print
We then present several new and efficient maintenance strategies for LSM-based storage systems.  ...  In this paper, we focus on efficient data ingestion and query processing for general-purpose LSM-based storage systems.  ...  This work is supported by NSF awards CNS-1305430, IIS-1447720, and IIS-1838248 along with industrial support from Amazon, Google, and Microsoft and support from the Donald Bren Foundation (via a Bren Chair  ... 
arXiv:1808.08896v2 fatcat:l676rpnkmnhz3baq6x5j3wwilm

Efficient data ingestion and query processing for LSM-based storage systems

Chen Luo, Michael J. Carey
2019 Proceedings of the VLDB Endowment  
We then present several new and efficient maintenance strategies for LSM-based storage systems.  ...  In this paper, we focus on efficient data ingestion and query processing for generalpurpose LSM-based storage systems.  ...  This work is supported by NSF awards CNS-1305430, IIS-1447720, and IIS-1838248 along with industrial support from Amazon, Google, and Microsoft and support from the Donald Bren Foundation (via a Bren Chair  ... 
doi:10.14778/3303753.3303759 fatcat:qv4s5o7rsnfqxikvwrtgf7nw6y

Dynamically maintaining configurations in the plane (Detailed Abstract)

Mark H. Overmars, Jan van Leeuwen
1980 Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80  
For a number of common configurations of points (lines) in the plane, we develop datastructures  ...  The case in which a double rotation must be carried out is very similar and will not be discussed in detail.  ...  Let us examine the case in which a single rotation must be carried out at node e (see figure 8).  ... 
doi:10.1145/800141.804661 dblp:conf/stoc/OvermarsV80 fatcat:vuggtv7qfve4jnnuf525nr2dry

UPI

Hideaki Kimura, Samuel Madden, Stanley B. Zdonik
2010 Proceedings of the VLDB Endowment  
We also propose several other optimizations, including techniques to improve secondary index performance and techniques to reduce maintenance costs and fragmentation by buffering changes to the table and  ...  We also show that our buffering techniques mitigate table fragmentation and keep the maintenance cost as low as or even lower than using an unclustered heap file.  ...  Hideaki Kimura and Stan Zdonik were supported in part by the NSF, under the grants IIS-0905553 and IIS-0916691.  ... 
doi:10.14778/1920841.1920922 fatcat:in2aqp5h2bdqriqkijk3mappbq

Algebraic incremental maintenance of XML views

Angela Bonifati, Martin Goodfellow, Ioana Manolescu, Domenica Sileo
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
We present algorithms for determining how updates should be propagated to views, and highlight the benefits of our approach over existing algorithms through a series of experiments.  ...  First, it relies on set-oriented, algebraic operations, to be contrasted with node-based previous approaches.  ...  by Deleting Tuples (PDDT) Input : view v, delete update u Output: updated view v ′ to reflect u Develop the 2 k − 1 union terms to be deleted to v in case of 1 deletions, and prune them based on XML constraints  ... 
doi:10.1145/1951365.1951388 dblp:conf/edbt/BonifatiGMS11 fatcat:achralyqzzgsxfgy3fq75glija

Algebraic incremental maintenance of XML views

Angela Bonifati, Martin Goodfellow, Ioana Manolescu, Domenica Sileo
2013 ACM Transactions on Database Systems  
We present algorithms for determining how updates should be propagated to views, and highlight the benefits of our approach over existing algorithms through a series of experiments.  ...  First, it relies on set-oriented, algebraic operations, to be contrasted with node-based previous approaches.  ...  by Deleting Tuples (PDDT) Input : view v, delete update u Output: updated view v ′ to reflect u Develop the 2 k − 1 union terms to be deleted to v in case of 1 deletions, and prune them based on XML constraints  ... 
doi:10.1145/2508020.2508021 fatcat:br3kzl5rbbfdbla3lftdijp5em

Distributed $k$ -Core View Materialization and Maintenance for Large Dynamic Graphs

Hidayet Aksu, Mustafa Canim, Yuan-Chi Chang, Ibrahim Korpeoglu, ozgur Ulusoy
2014 IEEE Transactions on Knowledge and Data Engineering  
These challenges inspired us to propose a new set of distributed algorithms for k-core view construction and maintenance on a horizontally scaling storage and computing platform.  ...  As the real world graphs such as social network graphs grow in size, the contents get richer and the topologies change dynamically, we are challenged not only to materialize k-core subgraphs for one time  ...  W911NF-11-C-0200 and W911NF-12-C-0028. The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1109/tkde.2013.2297918 fatcat:ws4aopylhne3tc64d3z2dziloe

SkyMap: A Trie-Based Index Structure for High-Performance Skyline Query Processing [chapter]

Joachim Selke, Wolf-Tilo Balke
2011 Lecture Notes in Computer Science  
superior scalability even for higher dimensions, and low costs for maintenance in face of data updates.  ...  In this paper we design and evaluate a trie-based indexing technique that solves the major efficiency bottlenecks of skyline queries.  ...  building and maintaining an index are bulkloading of entire data sets as well as inserting and deleting individual items.  ... 
doi:10.1007/978-3-642-23091-2_30 fatcat:cdaia2jg6ndrncijya5gt4krgu

Maintenance of configurations in the plane

Mark H. Overmars, Jan van Leeuwen
1981 Journal of computer and system sciences (Print)  
As a main result we establish a fully dynamic maintenance algorithm for convex hulls that can process insertions and deletions of single points in only O(log* n) steps per transaction, where n is the number  ...  OVERMARS AND JAN VAN LEEUWEN FIGURE I the ordered contour of the convex hull implies that sorting must be implicit in any algorithm and the Q(n log n) worst case lower bound applies to all of them which  ...  Hence we can delete the part of C MAINTENANCE OFCONFIGURATIONSINTHEPLANE 175 Case i. Let Case il. s lies below (or on) m. Case i2. s lies above m.  ... 
doi:10.1016/0022-0000(81)90012-x fatcat:juqd5jtfxnemrnjb5ygwo6jamq

An empirical classification-based framework for the safety criticality assessment of energy production systems, in presence of inconsistent data

Tai-Ran Wang, Vincent Mousseau, Nicola Pedroni, Enrico Zio
2017 Reliability Engineering & System Safety  
Three methods are proposed to address the second issue: (i) a model retrieval-based approach, (ii) the Bootstrap method and (iii) the cross-validation technique.  ...  An empirical classification model is developed, based on the Majority Rule Sorting method, to evaluate the class of criticality of the plant/system of interest, with respect to safety.  ...  Acknowledgements: The authors are thankful to François Beaudouin and Dominique Vasseur of EDF R&D for providing input classification examples and guidance throughout the work.  ... 
doi:10.1016/j.ress.2016.08.021 fatcat:veyhvn47nbfy5i42eqs5v6ilfu

Continuous monitoring of top-k queries over sliding windows

Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06  
We propose a general methodology for top-k monitoring that restricts processing to the sub-domains of the workspace that influence the result of some query.  ...  We present two processing techniques: the first one computes the new answer of a query whenever some of the current top-k points expire; the second one partially precomputes the future changes in the result  ...  Threshold Sorted List Algorithm A top-k monitoring technique must integrate two modules: (i) a method for the initial computation of the topk set, and (ii) an efficient maintenance mechanism to update  ... 
doi:10.1145/1142473.1142544 dblp:conf/sigmod/MouratidisBP06 fatcat:7wyaficv3rbofg5ohfxbdo3vyy

Resumable online index rebuild in SQL server

Panagiotis Antonopoulos, Hanuma Kodavalla, Alex Tran, Nitish Upreti, Chaitali Shah, Mirek Sztajno
2017 Proceedings of the VLDB Endowment  
other maintenance tasks are automatically handled by the Cloud platforms, introducing further unexpected failures for the users and d) most modern applications need to be available 24/7 and have very  ...  tight maintenance windows.  ...  Additionally, we would like to thank our leadership team for sponsoring the project and continuing to invest in our work in this area.  ... 
doi:10.14778/3137765.3137779 fatcat:b3ftyvziufdslcrumigls66o2y
« Previous Showing results 1 — 15 out of 26,475 results