49 lines
2.2 KiB
C++
49 lines
2.2 KiB
C++
/*------------------------------------------------------------------------------*
|
|
* Architecture & Implementation of DBMS *
|
|
*------------------------------------------------------------------------------*
|
|
* Copyright 2022 Databases and Information Systems Group TU Dortmund *
|
|
* Visit us at *
|
|
* http://dbis.cs.tu-dortmund.de/cms/en/home/ *
|
|
* *
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR *
|
|
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
|
|
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
|
|
* OTHER DEALINGS IN THE SOFTWARE. *
|
|
* *
|
|
* Authors: *
|
|
* Maximilian Berens <maximilian.berens@tu-dortmund.de> *
|
|
* Roland Kühn <roland.kuehn@cs.tu-dortmund.de> *
|
|
* Jan Mühlig <jan.muehlig@tu-dortmund.de> *
|
|
*------------------------------------------------------------------------------*
|
|
*/
|
|
|
|
#pragma once
|
|
#include <cstdint>
|
|
#include <optional>
|
|
#include <set>
|
|
#include <storage/page.h>
|
|
|
|
namespace beedb::index
|
|
{
|
|
/**
|
|
* Interface for non-unique indices.
|
|
* The index can store multiple values per key.
|
|
*/
|
|
class NonUniqueIndexInterface
|
|
{
|
|
public:
|
|
NonUniqueIndexInterface() = default;
|
|
virtual ~NonUniqueIndexInterface() = default;
|
|
|
|
/**
|
|
* Lookup for all values of a key.
|
|
*
|
|
* @param key Key to lookup.
|
|
* @return All stored values for the key.
|
|
*/
|
|
[[nodiscard]] virtual std::optional<std::set<storage::Page::id_t>> get(const std::int64_t key) const = 0;
|
|
};
|
|
} // namespace beedb::index
|