| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Updates for dynamic rate limitingnew-concurrency | Douglas Rumbaugh | 7 days | 3 | -23/+181 |
| | | |||||
| * | Merge branch 'new-concurrency' of ↵ | Douglas Rumbaugh | 2025-09-17 | 2 | -1/+91 |
| |\ | | | | | | | github.com:dbrumbaugh/dynamic-extension-working into new-concurrency | ||||
| | * | Per record cost estimation progress | Douglas B. Rumbaugh | 2025-08-14 | 1 | -0/+87 |
| | | | |||||
| | * | file_util.h: Swapped from random_shuffle to shuffle | Douglas B. Rumbaugh | 2025-08-12 | 1 | -1/+4 |
| | | | |||||
| * | | Last updates for dissertation | Douglas Rumbaugh | 2025-09-17 | 11 | -31/+562 |
| | | | |||||
| * | | updates | Douglas Rumbaugh | 2025-06-02 | 8 | -137/+39 |
| |/ | |||||
| * | update to knn sweep | Douglas Rumbaugh | 2025-06-02 | 1 | -2/+1 |
| | | |||||
| * | Merge branch 'new-concurrency' of ↵ | Douglas Rumbaugh | 2025-06-02 | 2 | -0/+146 |
| |\ | | | | | | | github.com:dbrumbaugh/dynamic-extension-working into new-concurrency | ||||
| | * | Merge branch 'new-concurrency' of ↵ | Douglas Rumbaugh | 2025-05-29 | 2 | -0/+154 |
| | |\ | | | | | | | | | | github.com:dbrumbaugh/dynamic-extension-working into new-concurrency | ||||
| | * | | Stall rate benchmarking | Douglas Rumbaugh | 2025-05-29 | 2 | -0/+146 |
| | | | | |||||
| * | | | KNN sweep | Douglas Rumbaugh | 2025-06-02 | 2 | -1/+148 |
| | |/ |/| | |||||
| * | | Added selectivity sweep benchmark | Douglas Rumbaugh | 2025-05-25 | 2 | -0/+154 |
| |/ | |||||
| * | Updates for tail latency stall testing | Douglas Rumbaugh | 2025-05-25 | 3 | -62/+214 |
| | | |||||
| * | Stats tweaks and KNN benchmark | Douglas Rumbaugh | 2025-04-30 | 3 | -8/+231 |
| | | |||||
| * | Scheduler statistics tracking update | Douglas Rumbaugh | 2025-04-25 | 1 | -6/+15 |
| | | | | | | | | | | The current scheme is really inefficient in terms of retreival of the results, but keeps the critical path mostly clear. It's probably worth it to do a more organized tracking of the data as it comes in, to avoid an n^2 statistics generation step at the end. | ||||
| * | switched k to a double | Douglas Rumbaugh | 2025-04-17 | 2 | -7/+6 |
| | | |||||
| * | New benchmarks | Douglas Rumbaugh | 2025-04-09 | 2 | -0/+337 |
| | | |||||
| * | Disabled early abort for point lookups | Douglas Rumbaugh | 2025-04-09 | 2 | -8/+35 |
| | | | | | | | | I'm having some trouble getting "bad" query performance, so I'm going to try using PLs w/o early abort as a worst-case scenario. This should get the best per-shard performance scaling | ||||
| * | BSM bugfixes | Douglas Rumbaugh | 2025-04-08 | 2 | -4/+5 |
| | | |||||
| * | Implemented the legacy policies and fixed a few bugs | Douglas Rumbaugh | 2025-04-07 | 2 | -79/+83 |
| | | |||||
| * | working commit (temporary progress, doesn't build) | Douglas Rumbaugh | 2025-04-05 | 4 | -83/+90 |
| | | |||||
| * | Fixed a few concurrency bugs | Douglas Rumbaugh | 2025-03-03 | 1 | -4/+16 |
| | | |||||
| * | Query Preemption: still has one or two bugs, but mostly works | Douglas Rumbaugh | 2025-02-24 | 3 | -4/+189 |
| | | |||||
| * | Added uniform data generator as file option | Douglas Rumbaugh | 2025-02-20 | 1 | -215/+240 |
| | | |||||
| * | Average version of mixed-workload bench | Douglas Rumbaugh | 2025-02-17 | 2 | -8/+186 |
| | | |||||
| * | Thread count sweep | Douglas Rumbaugh | 2025-02-17 | 1 | -7/+14 |
| | | |||||
| * | Fixed a few benchmark bugs | Douglas Rumbaugh | 2025-02-17 | 1 | -0/+4 |
| | | |||||
| * | Multi-threaded mixed workload benchmark | Douglas Rumbaugh | 2025-02-17 | 1 | -0/+150 |
| | | |||||
| * | Fixed legacy tiering policy | Douglas Rumbaugh | 2025-02-17 | 1 | -3/+3 |
| | | |||||
| * | BTree insertion latency benchmarks | Douglas Rumbaugh | 2025-02-17 | 1 | -0/+77 |
| | | |||||
| * | Retooled dist benchmark to actually print dist info | Douglas Rumbaugh | 2025-02-14 | 1 | -8/+7 |
| | | |||||
| * | Parallel background reconstructions appear to be working! | Douglas Rumbaugh | 2025-02-14 | 1 | -13/+0 |
| | | |||||
| * | progress towards resolving asynch structure merges | Douglas Rumbaugh | 2025-02-13 | 1 | -0/+12 |
| | | |||||
| * | more updates | Douglas Rumbaugh | 2025-02-11 | 1 | -0/+1 |
| | | |||||
| * | Progress: began adding parallel merging and locking of levels | Douglas Rumbaugh | 2025-02-11 | 1 | -1/+0 |
| | | |||||
| * | Migrated remaining tail latency benchmarks to new interface | Douglas Rumbaugh | 2025-02-10 | 2 | -10/+10 |
| | | |||||
| * | Background compaction stuff | Douglas Rumbaugh | 2025-02-06 | 3 | -2/+231 |
| | | |||||
| * | Additional layout policies + more flexibility in buffer flushing | Douglas Rumbaugh | 2025-01-16 | 4 | -29/+128 |
| | | |||||
| * | Tail latency parm sweep | Douglas Rumbaugh | 2025-01-08 | 1 | -0/+114 |
| | | |||||
| * | Ajusted progress bar in insert benchmark | Douglas Rumbaugh | 2025-01-07 | 1 | -1/+0 |
| | | |||||
| * | Fixed the reversed scale factor and buffer size on benchmarks | Douglas B. Rumbaugh | 2024-12-23 | 9 | -8/+9 |
| | | |||||
| * | Began migrating benchmarks over to new interface | Douglas Rumbaugh | 2024-12-23 | 14 | -30/+61 |
| | | |||||
| * | Adjusted query result interfacesHEADmaster | Douglas B. Rumbaugh | 2024-12-06 | 2 | -5/+3 |
| | | | | | | | | Now, the vector<> is part of the user-defined type, not required by the framework. This should allow for more flexibility in either using alternative containers, or for more sensible implementations of queries with single value results (like range count). | ||||
| * | Warning fixes | Douglas B. Rumbaugh | 2024-12-06 | 3 | -15/+20 |
| | | |||||
| * | Interface update (#5) | Douglas B. Rumbaugh | 2024-12-06 | 22 | -226/+113 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * Query Interface Adjustments/Refactoring Began the process of adjusting the query interface (and also the shard interface, to a lesser degree) to better accommodate the user. In particular the following changes have been made, 1. The number of necessary template arguments for the query type has been drastically reduced, while also removing the void pointers and manual delete functions from the interface. This was accomplished by requiring many of the sub-types associated with a query (parameters, etc.) to be nested inside the main query class, and by forcing the SHARD type to expose its associated record type. 2. User-defined query return types are now supported. Queries no longer are required to return strictly sets of records. Instead, the query now has LocalResultType and ResultType template parameters (which can be defaulted using a typedef in the Query type itself), allowing much more flexibility. Note that, at least for the short term, the LocalResultType must still expose the same is_deleted/is_tombstone interface as a Wrapped<R> used to, as this is currently needed for delete filtering. A better approach to this is, hopefully, forthcoming. 3. Updated the ISAMTree.h shard and rangequery.h query to use the new interfaces, and adjusted the associated unit tests as well. 4. Dropped the unnecessary "get_data()" function from the ShardInterface concept. 5. Dropped the need to specify a record type in the ShardInterface concept. This is now handled using a required Shard::RECORD member of the Shard class itself, which should expose the name of the record type. * Updates to framework to support new Query/Shard interfaces Pretty extensive adjustments to the framework, particularly to the templates themselves, along with some type-renaming work, to support the new query and shard interfaces. Adjusted the external query interface to take an rvalue reference, rather than a pointer, to the query parameters. * Removed framework-level delete filtering This was causing some issues with the new query interface, and should probably be reworked anyway, so I'm temporarily (TM) removing the feature. * Updated benchmarks + remaining code for new interface | ||||
| * | Added btree thread scaling benchmark | Douglas Rumbaugh | 2024-05-14 | 1 | -10/+10 |
| | | |||||
| * | Moved thread scalability bench to vldb folder | Douglas Rumbaugh | 2024-05-14 | 1 | -1/+1 |
| | | |||||
| * | Removed patricia trie stuff | Douglas Rumbaugh | 2024-05-14 | 1 | -112/+0 |
| | | |||||
| * | Poplar Trie: updated benchmark to standard format | Douglas Rumbaugh | 2024-05-14 | 2 | -31/+30 |
| | | |||||
| * | Added program to sample the binary knn files | Douglas Rumbaugh | 2024-05-11 | 1 | -0/+55 |
| | | |||||