Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2024
CoCo-trie: Data-aware compression and indexing of strings
AbstractWe address the problem of compressing and indexing a sorted dictionary of strings to support efficient lookups and more sophisticated operations, such as prefix, predecessor, and range searches. This problem occurs as a key task in a plethora of ...
- research-articleOctober 2023
DB+-tree: A new variant of B+-tree for main-memory database systems
AbstractThe B-tree and its variants are an indispensable tool for database systems and applications. Hence the efficiency of the B-tree is one of the few critical factors that determine the performance of a database system. In main-memory database ...
Highlights- DB+ tree redesigns the node structure of B+ tree for faster branching operation
- Our branching algorithm can be implemented in an O(1) number of instructions
- DB+ tree performs point search 170% faster than pkB-tree.
- DB+ tree ...
- research-articleSeptember 2022
BETULA: Fast clustering of large data with improved BIRCH CF-Trees
AbstractBIRCH clustering is a widely known approach for clustering that has influenced much subsequent research and commercial products. The key contribution of BIRCH is the Clustering Feature tree (CF-Tree), which is a compressed ...
Highlights- Improvement of the BIRCH algorithm.
- Improved numerical accuracy.
- research-articleFebruary 2022
Cracking in-memory database index: A case study for Adaptive Radix Tree index
AbstractIndexes provide a method to access data in databases quickly. It can improve the response speed of subsequent queries by building a complete index in advance. However, it also leads to a huge overhead of the continuous updating during ...
Highlights- In-memory database indexes have more extensive research and application space.
- ...
- research-articleFebruary 2022
Storing data once in M-trees and PM-trees: Revisiting the building principles of metric access methods
AbstractSince the introduction of the M-tree, a fundamental tree-based data structure for indexing multi-dimensional information, several structural enhancements have been proposed. One of the most effective ones is the use of additional ...
-
- research-articleJune 2017
Upscaledb
Compression can sometimes improve performance by making more of the data available to the processors faster. We consider the compression of integer keys in a B+-tree index. For this purpose, systems such as IBM DB2 use variable-byte compression over ...
- research-articleAugust 2016
Aggregated 2D range queries on clustered points
Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. We introduce a technique to represent grids ...
- articleMarch 2013
Practical perfect hashing in nearly optimal space
A hash function is a mapping from a key universe U to a range of integers, i.e., h:U@?{0,1,...,m-1}, where m is the range's size. A perfect hash function for some set S@?U is a hash function that is one-to-one on S, where m>=|S|. A minimal perfect hash ...
- articleMay 2011
Suffix trees for inputs larger than main memory
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix ...
- articleMarch 2009
2LP: A double-lazy XML parser
XML is acknowledged as the most effective format for data encoding and exchange over domains ranging from the World Wide Web to desktop applications. However, large-scale adoption into actual system implementations is being slowed down due to the ...
- articleJune 2008
Efficient memory representation of XML document trees
Information Systems (ISYS), Volume 33, Issue 4-5Pages 456–474https://doi.org/10.1016/j.is.2008.01.004Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is ...
- articleJuly 2007
Efficient in-memory extensible inverted file
The growing amount of on-line data demands efficient parallel and distributed indexing mechanisms to manage large resource requirements and unpredictable system failures. Parallel and distributed indices built using commodity hardware like personal ...
- articleMay 2007
Efficient schema-based XML-to-Relational data mapping
Storing and querying XML documents using a RDBMS is a challenging problem since one needs to resolve the conflict between the hierarchical, ordered nature of the XML data model and the flat, unordered nature of the relational data model. This conflict ...
- articleMarch 2007
Fast similarity join for multi-dimensional data
The efficient processing of multidimensional similarity joins is important for a large class of applications. The dimensionality of the data for these applications ranges from low to high. Most existing methods have focused on the execution of high-...
- articleMarch 2007
Data space mapping for efficient I/O in large multi-dimensional databases
In this paper, we propose data space mapping techniques for storage and retrieval in multi-dimensional databases on multi-disk architectures. We identify the important factors for an efficient multi-disk searching of multi-dimensional data and develop ...
- articleDecember 2006
Broadcasting and querying multi-dimensional index trees in a multi-channel environment
The continuous broadcast of data together with an index structure is an effective way of disseminating data in a wireless, mobile environment. The availability of an index allows a reduction in the tuning time and thus leads to lower power consumption ...
- research-articleSeptember 2005
An adaptive path index for XML data using the query workload
Information Systems (ISYS), Volume 30, Issue 6Pages 467–487Due to its flexibility, XML is becoming the de facto standard for exchanging and querying documents over the Web. Many XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured XML data. Without a structural ...
- articleJuly 2005
DDR: an index method for large time-series datasets
The tree index structure is a traditional method for searching similar data in large datasets. It is based on the presupposition that most sub-trees are pruned in the searching process. As a result, the number of page accesses is reduced. However, time-...
- articleMay 2004
A role model and its metaclass implementation
Information Systems (ISYS), Volume 29, Issue 3Pages 235–270https://doi.org/10.1016/S0306-4379(03)00029-2The role generic relationship for conceptual modeling relates a class of objects (e.g., persons) and classes of roles (e.g., students, employees) for those objects, The role relationship is meant to capture dynamic aspects of real-world objects while ...
- articleMarch 2004
A uniform framework for integration of information from the web
Information Systems (ISYS), Volume 29, Issue 1Pages 59–91https://doi.org/10.1016/S0306-4379(03)00005-XWe discuss a system that implements an integrated framework for Web exploration, wrapping, data integration, and querying. Here, the "integration" applies in three aspects: the data model and the functionality, and the architecture. The core of the ...