A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
In particular, we map the index structure to a relational database design and simulate the behavior of the index structure using triggers and stored procedures. ...
As the implementation of such an index structures is a difficult and time-consuming task, we propose a new approach to implement an index structure on top of a commercial relational database system. ...
Therefore, it is common to store productive data in a relational database system and to replicate the data for analysis purposes outside the database in file-based multidimensional index structures. ...
doi:10.1007/3-540-48298-9_28
fatcat:74xvi2rttjfipjdjqtz3gju4oa
Native Multidimensional Indexing in Relational Databases
2008
International Conference on Management of Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In existing database systems there is a strong need for searching data according to many attributes. ...
In this paper we propose a native multidimensional method for indexing tables with simple attributes, such that multi-attribute queries can be processed (with standard SQL queries) more efficiently than ...
Conclusion In this paper we applied the R-tree into PostgreSQL for native multidimensional indexing of relational databases. ...
dblp:conf/comad/HokszaS08
fatcat:ielfvxfaivgafczfuum5hsb7ty
Processing Distance-Based Queries in Multidimensional Data Spaces Using R-trees
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate the performance of the most representative distance-based queries in multidimensional data spaces, where the point datasets are indexed by tree-like structures belonging to ...
In modern database applications the similarity, or dissimilarity of data objects is examined by performing distance-based queries (DBQs) on multidimensional data. ...
Introduction Large sets of multidimensional data are used in modern applications such as multimedia databases [12] , medical images databases [21] , CAD [18] , metric databases [2], etc. ...
doi:10.1007/3-540-38076-0_1
fatcat:va4bqlzyxrb3vkfisynvfyd244
Multidimensional Mapping and Indexing of XML
2003
Datenbanksysteme für Business, Technologie und Web
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We propose a multidimensional approach to store XML data in relational database systems. In contrast to other efforts we suggest a solution to the problem using established database technology. ...
We present a multidimensional mapping scheme for XML and also thoroughly study the impact of established and commercially available multidimensional index structures (compound B-Trees and UB-Trees) on ...
This has to be especially taken care of when chosing indexes in database schemas for storing XML. ...
dblp:conf/btw/BauerRB03
fatcat:bxx7xxyktfggnl6bbfeowyltue
Multi-dimensional database technology based on artificial intelligence
2021
MATEC Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
and multidimensional database and the current research field, and gives the research direction. ...
Artificial intelligence and database technology are both important fields of computer science. ...
The core is relational database, that is to express and store multidimensional data through relational structure. ...
doi:10.1051/matecconf/202133605001
fatcat:uitlqi44erbhvkkhmmtkphlwk4
Fusion OLAP: Fusing the Pros of MOLAP and ROLAP Together for In-memory OLAP
2018
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The Fusion OLAP model can be integrated into the state-of-the-art in-memory databases with additional surrogate key indexes and vector indexes. ...
This is achieved by mapping the relation tables into virtual multidimensional model and binding the multidimensional operations into a set of vector indexes to enable multidimensional computing on relation ...
foreign key join in relational databases. ...
doi:10.1109/tkde.2018.2867522
fatcat:vfrtcmiqsvfodeahtx6oake2uu
Comparison of Advance Tree Data Structures
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper different variants of Btree and Rtree are discussed and compared. Index structures are different in terms of structure, query support, data type support and application. ...
Btree and Rtree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization. ...
Relational database systems that have conventional access method, R-tree is easy to add. ...
doi:10.5120/5512-7504
fatcat:qxyhgyx4yrgelpnl44gvvz4w3i
Physical Data Warehouse Design Using Neural Network
2010
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Traditionally, OLAP system has been built on top of a relational database system, therefore, referred as relational OLAP (ROLAP), where data is stored in tables. ...
Our approach for multidimensional database indexing Indexing of the multidimensional database is done by indexing each data values of each dimension. ...
doi:10.5120/77-172
fatcat:2ccwbibw4vhcvfxbxlaqrthzvi
Indexing of Tables Referencing Complex Structures
[article]
2003
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Comparisons using bitmap indexing in the Oracle 9.2i database, on the one hand, and multidimensional clustering in DB2 8.1.2, on the other hand, are used to illustrate the applicability of the indexing ...
It is illustrated how to use the schemas, in connection with additional relational database technologies, to optimize queries conditioned on the structural information being referenced. ...
Acknowledgments This research has been sponsored by deCODE Genetics, Inc. in Iceland. ...
arXiv:cs/0309011v1
fatcat:33ttu54mvze4xlgf7l4upnxpue
Research on the Revolution of Multidimensional Learning Space in the Big Data Environment
2021
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The results show that RDIBT has higher performance than LSII index technology in index creation speed and search response speed. In addition, RDIBT can also ensure the scalability of the index system. ...
In this context, it is oriented to multiusers of multidimensional learning resources. Shared clusters have become a new topic. ...
and the physical layer still uses the storage structure of a relational database, so it is called virtual OLAP. ...
doi:10.1155/2021/6583491
fatcat:bgk2zv7mzrgibjj4lg3tmtvbwa
Analytical Classification of Multimedia Index Structures by Using a Partitioning Method-Based Framework
[article]
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Due to variety and plenty of proposed index structures, we suggest a systematic framework based on partitioning method used in these structures to classify multimedia index structures, and then we evaluated ...
Due to the advances in hardware technology and increase in production of multimedia data in many applications, during the last decades, multimedia databases have become increasingly important. ...
RELATED WORK During past decades, different kinds of index structures for supporting efficient similarity search in multidimensional databases including multimedia databases have been proposed. ...
arXiv:1105.1948v1
fatcat:hofkrcz3o5dp7efaua5242dpoq
Schemaless Semistructured Data Revisited
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Uniform treatment of schema information and data, in other words, uniform treatment of metadata and data, is important in the design of such data models. ...
The paper revises one of the standard semistructured data models in accordance with that argument, and eventually reinvents the deterministic semistructured data model proposed by Peter Buneman and his ...
He also helped me and my wife enjoy life in Philadelphia during our stay there. Those thirteen months are a memorable period in both my research career and my personal life. ...
doi:10.1007/978-3-642-41660-6_25
fatcat:bttcyvzfuvgx3enaqd2ktdugfu
Cracking KD-Tree: The First Multidimensional Adaptive Indexing (Position Paper)
2018
Proceedings of the 7th International Conference on Data Science, Technology and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present our on-going work on a new set of workload-adaptive indexing techniques that focus on creating multidimensional indexes. ...
It works by incrementally creating partial multidimensional indexes as a by-product of query processing. ...
approach for relational databases. ...
doi:10.5220/0006944203930399
dblp:conf/data/HolandaNAM18
fatcat:ej6stane5vartm7iknvf6sbm4y
Modelling and manipulating multidimensional data in semistructured databases
2001
Proceedings Seventh International Conference on Database Systems for Advanced Applications DASFAA 2001 DASFAA-01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It can be used in applications such as multidimensional spreadsheets and multidimensional databases usually found in decision suport systems and data warehouses. ...
Finally a multidimensional, X M L database system has been prototyped and described in detail. Technologies such as XSL are used t o transf o r m or visualise datu from different dimensions. ...
Ongoing research work includes the further investigation on query optimization for multidimensional data and incremental maintenance of the materialized views for MLP. ...
doi:10.1109/dasfaa.2001.916359
dblp:conf/dasfaa/LamWO01
fatcat:xsbninx53bhevihpxwokykctbm
Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data
2013
Asia-pacific Journal of Multimedia services convergent with Art Humanities and Sociology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the second step, we store the voronoi cells in an index structure efficient for high-dimensional data spaces. ...
As a result, nearest neighbor search corresponds to a simple point query on the index structure. ...
a multidimensional index structure such as the X-tree [BKK 96]. ...
doi:10.14257/ajmscahs.2013.06.01
fatcat:t2gkyzewnbcsxmeatyy7orf3ym
« Previous
Showing results 1 — 15 out of 69,915 results