B-tree - PDFSEARCH.IO - Document Search Engine

B-tree
Results: 1294

#	Item
81	Implementing Sorting in Database Systems GOETZ GRAEFE Microsoft Most commercial database systems do (or should) exploit many sorting techniques that are publicly known, but not readily available in the research literatur Add to Reading List Source URL: wwwlgis.informatik.uni-kl.de Language: English - Date: 2006-11-07 04:12:03 Sorting algorithms Trie Radix sort Quicksort Sorting String Lossless compression Huffman coding External sorting Extensible Storage Engine Binary tree B-tree
82	Speeding up Search in Peer-to-Peer Networks with A Multi-way Tree Structure H. V. Jagadish ∗ Beng Chin Ooi † Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2006-03-26 20:55:38 Distributed data storage Binary trees Data types B-tree R-tree Chord Tree Binary search tree T-tree Routing R* tree Node
83	CSE 584A Class 11 Jeremy Buhler February 24, 2016 1 Add to Reading List Source URL: classes.engineering.wustl.edu Language: English - Date: 2016-02-23 18:02:46 Arrays LCP array Suffix tree B-tree Knowledge representation Suffix array String searching algorithm Tree traversal Tree Linked list Maximal pair
84	Learning Extended Tree Augmented Naive StructuresI Cassio P. de Camposa,∗, Giorgio Coranib , Mauro Scanagattab , Marco Cuccuc , Marco Zaffalonb b Istituto a Queen’s University Belfast, UK Dalle Molle di Studi sull’ Add to Reading List Source URL: ipg.idsia.ch Language: English - Date: 2016-03-17 09:50:40 Statistical classification Machine learning Naive Bayes classifier Supervised learning Averaged one-dependence estimators Bayesian network Feature selection Minimum spanning tree X0
85	Formally Verifying a File System: A Successful Failure CSCI-P515/P415 Spring 2008 Michael Adams () Add to Reading List Source URL: michaeldadams.org Language: English - Date: 2012-07-27 19:09:55 B-tree File system PVS Algorithm Computer file
86	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Oblivious data structure Maximal independent set
87	This is an author-prepared, pre-publication copy of the paper “Hybrid Index Maintenance for Contiguous Inverted Lists”, to be published in the Information Retrieval journal some time inFor the final version of Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2007-12-30 19:50:53 Data management B-tree Index Search engine indexing Inverted index Extensible Storage Engine Database index Database Desktop search Data Trie Document retrieval
88	Approximate Aggregation Techniques for Sensor Databases Jerey Considine, Feifei Li, George Kollios, and John Byers Computer Science Dept., Boston University fjconsidi, lifeifei, gkollios, Abstract Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2003-12-19 20:40:17 B-tree Wireless sensor network Distributed data storage Hashing
89	A Framework for Supporting DBMS-like Indexes in the Cloud Gang Chen Hoang Tam Vo, Sai Wu, Beng Chin Ooi Add to Reading List Source URL: www.yzbigdata.com Language: English Distributed data storage Parallel computing B-tree Database index Databases Chord Data-intensive computing BATON Overlay Database MapReduce Query optimization Apache Cassandra
90	Efficiently Evaluating Complex Boolean Expressions Marcus Fontoura Suhas Sadanandan Jayavel Shanmugasundaram Sergei Vassilvitski Erik Vee Srihari Venkatesan Jason Zien Yahoo! Research, 701 First Ave., Sunnyvale, CA 94089 Add to Reading List Source URL: fontoura.org Language: English - Date: 2010-03-16 13:13:45 Recursion Binary trees Knowledge representation Computability theory B-tree Binary expression tree Tree traversal Disjunctive normal form Tree Parallel Tree Contraction Interval tree