Filters








117,566 Hits in 9.5 sec

Challenges in Finding an Appropriate Multi-Dimensional Index Structure with Respect to Specific Use Cases

Alexander Grebhahn, David Broneske, Martin Schäler, Reimar Schröter, Veit Köppen, Gunter Saake
2012 Workshop Grundlagen von Datenbanken  
Due to heterogeneous systems and specific use cases, it is a complex challenge to find an appropriate index structure for specific problems, such as finding similar fingerprints or micro traces in a database  ...  To address the challenges of finding the appropriate index, we motivate the necessity of a framework to evaluate indexes for specific use cases.  ...  Additionally we want to thank Sandro Schulze for giving us useful comments.  ... 
dblp:conf/gvd/GrebhahnBSSKS12 fatcat:63r2zvpwfrf3lb26akyi3ru7ga

@neurIST complex information processing toolchain for the integrated management of cerebral aneurysms

M. C. Villa-Uriol, G. Berti, D. R. Hose, A. Marzo, A. Chiarini, J. Penrose, J. Pozo, J. G. Schmidt, P. Singh, R. Lycett, I. Larrabide, A. F. Frangi
2011 Interface Focus  
A core part of the European project @neurIST was the physical characterization of aneurysms to find candidate risk factors associated with aneurysm rupture.  ...  Cerebral aneurysms are a multi-factorial disease with severe consequences.  ...  DISCUSSION A number of unique challenges were associated with the large-scale multi-case, multi-operator and multi-site biomechanical processing undertaken by @neurIST.  ... 
doi:10.1098/rsfs.2010.0033 pmid:22670202 pmcid:PMC3262441 fatcat:4hh27vltdbektfof2mhxn3tly4

Online Index Recommendations for High-Dimensional Databases Using Query Workloads

M. Gibas, G. Canahuate, H. Ferhatosmanoglu
2008 IEEE Transactions on Knowledge and Data Engineering  
High-dimensional databases pose a challenge with respect to efficient access. High-dimensional indexes do not work because of the oft-cited 'curse of dimensionality'.  ...  A potential solution is to use lower dimensional indexes that accurately represent the user access patterns.  ...  ACKNOWLEDGMENT We would like to thank the anonymous TKDE reviewers for their many insightful and helpful comments.  ... 
doi:10.1109/tkde.2007.190690 fatcat:q7vx7ktmtncvrgwphmop6js6we

A multi-slice simulation algorithm for grazing-incidence small-angle X-ray scattering

S. V. Venkatakrishnan, Jeffrey Donatelli, Dinesh Kumar, Abhinav Sarje, Sunil K. Sinha, Xiaoye S. Li, Alexander Hexemer
2016 Journal of Applied Crystallography  
However, simulating complex structures in the multi-slice setting is challenging and the algorithms typically used are designed on a case-by-case basis depending on the structure to be simulated.  ...  Furthermore, this algorithm is general with respect to the sample structure, and does not require any sample-specific approximations to perform the simulations.  ...  The MAGIXS method provides an accurate numerical technique to simulate GISAXS patterns from complex geometries.  ... 
doi:10.1107/s1600576716013273 fatcat:2iazwoetffc6rchak36aoqxom4

Online Indexing Structure for Big Image Data used for 3D Reconstruction

Konstantinos Makantasis, Yannis Katsaros, Anastasios Doulamis, Matthaios Bimpas
2016 Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications  
The presented approach is capable, on the one hand to index images in a fast and accurate way and on the other to select form an image dataset the most appropriate images for 3D reconstruction, improving  ...  For this reason, this paper aims to describe a new image indexing scheme with application in 3D reconstruction.  ...  ACNOWLEDGEMENTS The research leading to these results has been supported by Marie Curie IAPP project 4D-CH-World: Four Dimensional Cultural Heritage World. Grant agreement number324523.  ... 
doi:10.5220/0005852207050714 dblp:conf/visapp/MakantasisKDB16 fatcat:mkng7224qjh3lmndidn3l5rkya

Big Data architecture for intelligent maintenance: a focus on query processing and machine learning algorithms

Claude Lehmann, Lilach Goren Huber, Thomas Horisberger, Georg Scheiba, Ana Claudia Sima, Kurt Stockinger
2020 Journal of Big Data  
Finally, we describe a concrete fault detection use case with two different health monitoring algorithms based on machine learning and classical statistics and discuss their advantages and disadvantages  ...  The paper covers some of the most important aspects of the practical implementation of such an end-to-end solution and demonstrates the challenges and their mitigation for the specific application of laser  ...  However, this problem grows more complex for a multi-dimensional use case. Other approaches are necessary to efficiently apply indexing to accelerate multi-dimensional queries.  ... 
doi:10.1186/s40537-020-00340-7 fatcat:223homnwufchhkh5pivbenrz3u

Modeling and Visualization Approaches for Time-Varying Volumetric Data [chapter]

Kenneth Weiss, Leila De Floriani
2008 Lecture Notes in Computer Science  
Time-varying volumetric data arise in a variety of application domains, and thus several techniques for dealing with such data have been proposed in the literature.  ...  A time-varying dataset is typically modeled either as a collection of discrete snapshots of volumetric data, or as a four-dimensional dataset.  ...  of the cell with respect to the isovalue.  ... 
doi:10.1007/978-3-540-89646-3_100 fatcat:jepwymhnxzfujhprtce5plomai

Replica-aware, multi-dimensional range queries in Distributed Hash Tables

Antony Chazapis, Athanasia Asiki, Georgios Tsoukalas, Dimitrios Tsoumakos, Nectarios Koziris
2010 Computer Communications  
We also present an application scenario and the respective deployment details of a prototype implementation in the context of the Gredia project.  ...  Moreover, we suggest pairing respective operations with the core DHT routing mechanics, which allows for reusing existing management and monitoring structures and automatically adapting the query path  ...  However, when respective operations are applied to multi-dimensional values, the amount of visited neighborhoods is also affected by the number of index dimensions used.  ... 
doi:10.1016/j.comcom.2010.01.024 fatcat:x5qxp2xr3fe4lewq3nzt5nqer4

SemTree: An index for supporting semantic retrieval of documents

Flora Amato, Aniello De Santo, Francesco Gargiulo, Vincenzo Moscato, Fabio Persia, Antonio Picariello, Silvestro Roberto Poccia
2015 2015 31st IEEE International Conference on Data Engineering Workshops  
We investigate the feasibility of our approach in a real case study, considering the problem of finding inconsistencies in documents related to software requirements and report some preliminary experimental  ...  A distributed version of KD Tree has been then adopted for providing a scalable solution to the document indexing, leveraging the mapping of triples in a vectorial space.  ...  Furthermore, scalability issues are met in a similar manner to our method by the proposal in [8] , wherein a multi dimensional indexing structures layered over a key-value database is opportunely used  ... 
doi:10.1109/icdew.2015.7129546 dblp:conf/icde/AmatoSGMPPP15 fatcat:pt6gxceglfhuxnbjmrfaup4osu

Psychometric properties of Persian Version Dispositional Flow Scale -2 (DFS-2)

Hadi Nojavan Alanagh, Hassan Gharayagh Zandi, Rasool Hemayat Talab
2017 IOSR Journal of Sports and Physical Education  
, confirmatory factor analysis were used respectively.  ...  The current study was done in order to examine the psychometric properties of Persian Version of Dispositional Flow Scale-2 (DFS-2) among Iranian athletes.  ...  (14) Studies in the field of flow have been met with some skepticism in some cases.  ... 
doi:10.9790/6737-04030411 fatcat:bypzfxibyjhjjh23smlnxglwx4

SANE: Semantic-Aware Namespacein Ultra-Large-Scale File Systems

Yu Hua, Hong jiang, Yifeng Zhu, Dan Feng, Lei Xu
2014 IEEE Transactions on Parallel and Distributed Systems  
Explosive growth in volume and complexity of data exacerbates the key challenge to effectively and efficiently manage data in a way that fundamentally improves the ease and efficacy of their use.  ...  Existing large-scale file systems rely on hierarchically structured namespace that leads to severe performance bottlenecks and renders it impossible to support real-time queries on multi-dimensional attributes  ...  An R-tree [21] is a tree-based data structure that, similar to B-tree [22] , is often used to represent and index spatial multi-dimensional data.  ... 
doi:10.1109/tpds.2013.140 fatcat:2zd6qygebvhk7fylw56fsy24au

Advanced Indexing Techniques for Wide-Area Network Monitoring

Xin Li, Fang Bian, Hui Zhang, C. Diot, R. Govindan, Wei Hong Hong, G. Lannaccone
2005 21st International Conference on Data Engineering Workshops (ICDEW'05)  
We argue that, in addition to supporting other types of queries, the network monitoring query system must support multi-dimensional range queries on traffic records (flows, or aggregated flow records).  ...  We discuss the design of MIND, a distributed indexing system which supports the creation of multiple distributed indices that use proximal hashing to scalably respond to range queries.  ...  Q 1 defines a 5-dimensional data space T 1 : T 1 : destination, f anout, source, node,timestamp . In most cases, one will build an index on the first three attributes.  ... 
doi:10.1109/icde.2005.183 dblp:conf/icde/LiBZDGHL05 fatcat:jlrkbmwmg5fttn55hcpit37l24

A distributed database for bio-molecular images

Ambuj K. Singh, B. S. Manjunath, Robert F. Murphy
2004 SIGMOD record  
Information technology research has played a significant role in the genomics revolution over the past decade, from aiding with large-scale sequence assembly to automating gene identification to efficiently  ...  Such searchable databases will make it possible to optimally understand and interpret the data, leading to a more complete and integrated understanding of cellular structure, function and regulation.  ...  The research work described above is supported by the National Science Foundation under an ITR project titled Next Generation Bio-Molecular Imaging and Information Discovery (grant number EF-0331697).  ... 
doi:10.1145/1024694.1024705 fatcat:a6xtl3hvtredfcaa2ox3p7vc3e

Efficient continuous skyline computation on multi-core processors based on Manhattan distance

Ehsan Montahaie, Milad Ghafouri, Saied Rahmani, Hanie Ghasemi, Farzad Sharif Bakhtiar, Rashid Zamanshoar, Kianoush Jafari, Mohsen Gavahi, Reza Mirzaei, Armin Ahmadzadeh, Saeid Gorgin
2015 2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)  
Moreover, we use several optimization methods to optimize memory usage in comparison with naïve implementation.  ...  Therefore, this query is considered as a computation intensive operation that finding the result in a reasonable time is a challenge.  ...  The subject of MEMOCODE 2015 Design Contest challenge is to find the best approach (pure-performance or cost-adjusted-performance) for computing the Skyline of a multi-dimensional dynamic dataset.  ... 
doi:10.1109/memcod.2015.7340469 dblp:conf/memocode/MontahaieGRGBZJ15 fatcat:6vv7qgognjfanpk5zlla42xnym

Scalable community-driven data sharing in e-science grids

Tobias Scholl, Bernhard Bauer, Benjamin Gufler, Richard Kuntschke, Angelika Reiser, Alfons Kemper
2009 Future generations computer systems  
HiSbase is an approach to data management in scientific federated Data Grids that addresses the scalability issue by combining established techniques of database research in the field of spatial data structures  ...  E-science projects of various disciplines face a fundamental challenge: thousands of users want to obtain new scientific results by application-specific and dynamic correlation of data from globally distributed  ...  The distributed quadtree index [34] also supports range queries and objects with multi-dimensional extents.  ... 
doi:10.1016/j.future.2008.05.006 fatcat:lyrd662cwvgotlriwnociwnzzi
« Previous Showing results 1 — 15 out of 117,566 results