Filters








3,813 Hits in 4.5 sec

Effective Pattern Similarity Match for Multidimensional Sequence Data Sets [chapter]

Seok-Lyong Lee, Deok-Hwan Kim
2007 Lecture Notes in Computer Science  
Using the trend vector, our method is designed to filter out irrelevant sequences from a database and to find similar sequences with respect to a query.  ...  In this paper we present an effective pattern similarity match algorithm for multidimensional sequence data sets such as video streams and various analog or digital signals.  ...  Using the measures, our method prunes irrelevant sequences from a database with respect to a given query.  ... 
doi:10.1007/978-3-540-72584-8_27 fatcat:qzg77owvdfb5zkvhzatx64udki

SHIFT-SPLIT

Mehrdad Jahangiri, Dimitris Sacharidis, Cyrus Shahabi
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
The Discrete Wavelet Transform is a proven tool for a wide range of database applications.  ...  However, despite broad acceptance, some of its properties have not been fully explored and thus not exploited, particularly for two common forms of multidimensional decomposition.  ...  Furthermore, queries on wavelet-transformed data exhibit a particular access pattern.  ... 
doi:10.1145/1066157.1066189 dblp:conf/sigmod/JahangiriSS05 fatcat:hpvl7qepqjhflkqxwumervbpje

Cracking KD-Tree: The First Multidimensional Adaptive Indexing (Position Paper)

Pedro Holanda, Matheus Nerone, Eduardo C. de Almeida, Stefan Manegold
2018 Proceedings of the 7th International Conference on Data Science, Technology and Applications  
We present our proof-of-concept, the Cracking KD-Tree, an adaptive indexing approach that generates a KD-Tree based on multidimensional range query predicates.  ...  It works by incrementally creating partial multidimensional indexes as a by-product of query processing.  ...  Figure 2 depicts an example of database cracking (Idreos et al., 2007) answering a multidimensional range query.  ... 
doi:10.5220/0006944203930399 dblp:conf/data/HolandaNAM18 fatcat:ej6stane5vartm7iknvf6sbm4y

exploratory DSP - Wavelet-Based Approximation Techniques in Database Systems

Minos Garofalakis
2006 IEEE Signal Processing Magazine  
This data gives rise to massive, multidimensional relational data tables typically stored and queried/analyzed using commercial database engines (e.g., Oracle, SQL Server, DB2).  ...  growing number of database applications require online, interactive access to very large volumes of data to perform a variety of data analysis tasks.  ...  This data gives rise to massive, multidimensional relational data tables typically stored and queried/analyzed using commercial database engines (e.g., Oracle, SQL Server, DB2).  ... 
doi:10.1109/sp-m.2006.248713 fatcat:ewyvb4kxwzgkblmptyurizgm2e

Enforcing Privacy in Cloud Databases [article]

Somayeh Sobati Moghadam, Gérald Gavin
2017 arXiv   pre-print
Outsourcing databases, i.e., resorting to Database-as-a-Service (DBaaS), is nowadays a popular choice due to the elasticity, availability, scalability and pay-as-you-go features of cloud computing.  ...  data are sensitive to some extent, and data privacy remains one of the top concerns to DBaaS users, for obvious legal and competitive reasons.In this paper, we survey the mechanisms that aim at making databases  ...  Moreover, they propose a new method for answering range queries on multidimensional data [38] .  ... 
arXiv:1708.09171v1 fatcat:stvwiwy3b5bo5gdxmxcv3w46pm

Managing scientific data

Anastasia Ailamaki, Verena Kantere, Debabrata Dash
2010 Communications of the ACM  
The inefficiency of existing database management systems (DBMSs) for addressing the requirements of scientists has led to many application-specific systems.  ...  Patterns of query expression are also limited, featuring conjunctions of range and user-defined functions in both the predicate and the join clause. Simulation scientific data.  ...  Querying on files is assumed to be efficient since it would benefit from sophisticated database structures (such as indexes, autonomic database organization, and database query planning).  ... 
doi:10.1145/1743546.1743568 fatcat:vw57d23aorchtntng6jlrccs6y

Managing scientific data

Anastasia Ailamaki
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
The inefficiency of existing database management systems (DBMSs) for addressing the requirements of scientists has led to many application-specific systems.  ...  Patterns of query expression are also limited, featuring conjunctions of range and user-defined functions in both the predicate and the join clause. Simulation scientific data.  ...  Querying on files is assumed to be efficient since it would benefit from sophisticated database structures (such as indexes, autonomic database organization, and database query planning).  ... 
doi:10.1145/1989323.1989433 dblp:conf/sigmod/Ailamaki11 fatcat:3cxviarugnfoldnqz3csgjczqu

An adaptive view element framework for multi-dimensional data management

John R. Smith, Chung-Sheng Li
1999 Proceedings of the eighth international conference on Information and knowledge management - CIKM '99  
Keywords -Multimedia database systems, data management, OLAP, data cubes, content-based search, digital libraries, and information retrieval.  ...  The graphs are used to guide cost-based view element selection algorithms for optimizing compression, access, retrieval and search performance.  ...  The perfect reconstruction property allows that the data is reconstructed from any complete set of elements.  ... 
doi:10.1145/319950.320021 dblp:conf/cikm/SmithL99 fatcat:uhu64jnbvndnzkubiezsmmgjna

Incremental Indexing for High-Dimensional Data using Tree Structure

R Vishnu Priya, A. Vadivel
2012 Procedia Technology - Elsevier  
In content-based image retrieval applications, users wait for long query time to retrieve similar images from the dynamic growing database.  ...  The vectors are clustered based on the patterns to support indexing by avoiding both overlapping of vectors and extra factors for clustering.  ...  It is found that the total number of vectors from three clusters is ranged from . We have retrieved from Corel with and without indexing and compared the output.  ... 
doi:10.1016/j.protcy.2012.10.065 fatcat:ztdfvorjhfat7g2rna2lvb5eca

Multi-dimensional Range Query on Outsourced Database with Strong Privacy Guarantee

Do Hoang Giang, Ng Wee Keong
2017 International Journal of Computer Network and Information Security  
This paper investigates a solution to one of the most important types of query operations over encrypted data, namely multidimensional range queries.  ...  However, data outsourcing not only deprives clients of direct control over their data but also allows the server to gain direct access to the client data.  ...  For full-domain multidimensional range queries, we randomly generate 10,000 queries where each dimension is selected randomly from a uniform distribution from the same domain with the dataset.  ... 
doi:10.5815/ijcnis.2017.10.02 fatcat:ni37ysodvrcpxofeawexjug2va

A New Way for Multidimensional Medical Data Management: Volume of Interest (VOI)-Based Retrieval of Medical Images With Visual and Functional Features

J. Kim, W. Cai, D. Feng, H. Wu
2006 IEEE Transactions on Information Technology in Biomedicine  
Although such approach has the advantage of including only relevant regions in the formulation of a query, medical images that are inherently multidimensional can potentially benefit from the multidimensional  ...  Content-based image retrieval (CBIR) refers to the retrieval of images from a database, using the visual features derived from the information in the image, and has become an attractive approach to managing  ...  It is well acknowledged that medical image databases, which enable access to a patient's historical data, including multidimensional medical images from previous examinations and the opportunity for statistical  ... 
doi:10.1109/titb.2006.872045 pmid:16871730 fatcat:tv57u4ymfnbp5cwtezox2rpmy4

SEACOW: Synopsis Embedded Array Compression using Wavelet Transform [article]

Minsoo Kim, Hyubjin Lee, Yon Dohn Chung
2021 arXiv   pre-print
To perform experiments, we implemented an array database, SEACOW storage, and evaluated query processing performance on real data sets.  ...  This study presents a novel compression scheme, SEACOW, for storing and querying multidimensional array data.  ...  In an * Corresponding author. array database, data are represented as a multidimensional indexed array, which enables rapid access to elements at a specific position.  ... 
arXiv:2109.07699v1 fatcat:dxd4wjmyovbu5pipuhhq2iprkq

Secure kNN Computation and Integrity Assurance of Data Outsourcing in the Cloud

Jun Hong, Tao Wen, Quan Guo, Zhengwang Ye
2017 Mathematical Problems in Engineering  
Data privacy and query integrity are perceived as two major factors obstructing enterprises from outsourcing their databases.  ...  It is indicated from the security analysis and experiment results that our scheme not only maintains the confidentiality of outsourced confidential data and query points but also has a lower kNN query  ...  In multidimensional database outsourcing, Cheng et al.  ... 
doi:10.1155/2017/8109730 fatcat:jg24dtvfnjcjdltxw7momuxh3m

Bi-temporal Timeline Index: A data structure for Processing Queries on bi-temporal data

Martin Kaufmann, Peter M. Fischer, Norman May, Chang Ge, Anil K. Goel, Donald Kossmann
2015 2015 IEEE 31st International Conference on Data Engineering  
In this paper, we present the Bi-temporal Timeline Index, which supports a broad range of temporal operators and exploits the special properties of an in-memory column store database system.  ...  data structures from research.  ...  We express all these access patterns as range queries on a temporal range [s, e], where ⊥ denotes an unspecified point in time.  ... 
doi:10.1109/icde.2015.7113307 dblp:conf/icde/KaufmannFMGGK15 fatcat:fvyxhxytkjakrots63pzly5itq

Cubrick

Pedro Pedreira, Chris Croswhite, Luis Bona
2016 Proceedings of the VLDB Endowment  
Finally, we present results from a thorough experimental evaluation that leveraged datasets and queries collected from a few internal Cubrick deployments at Facebook.  ...  All data stored in Cubrick is range partitioned by every dimension and stored within containers called bricks in an unordered and sparse fashion, providing high data ingestion rates and indexed access  ...  From these experimental results, we observe a pattern that goes from yellow to black as the query latency increases, independent of the dimension being filtered -the value for x.  ... 
doi:10.14778/3007263.3007269 fatcat:krf5qjcnjrg47m34gvb53apum4
« Previous Showing results 1 — 15 out of 3,813 results