22 Hits in 4.4 sec

Skyline Queries in O(1) time? [article]

Spyros Sioutas, Kostas Tsichlas, Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Dimitrios Tsoumakos, Katerina Doka
2017 arXiv   pre-print
In dynamic case, the update time complexity is affected by a O(log^2N) factor.  ...  In particular, it supports skyline queries in a 3-sided range in O(t· t_PAM(N)) time (O((t/B)· t_PAM(N)) I/Os), where t is the answer size and t_PAM(N) the time required for answering predecessor queries  ...  Figure 4 4 The dynamic linear-space MLR-tree. space, supports updates in O(log 2 N log log N ) time in expectation with high probability and has an expected query time of O(t).  ... 
arXiv:1709.03949v1 fatcat:n4vyzkadsbfcpfiputoe53ay7a

Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)

Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal, Marc Herbstritt
2017 Dagstuhl Reports  
Probabilistic methods play a central role in theoretical computer science.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods in the Design and Analysis of Algorithms".  ...  On coalescence time in graphs -When is coalescing as fast as meeting?  ... 
doi:10.4230/dagrep.7.4.1 dblp:journals/dagstuhl-reports/MantheyMRU17 fatcat:37g24odqhvg3rnlpudblwug6hy

Effective indexing for approximate constrained shortest path queries on large road networks

Sibo Wang, Xiaokui Xiao, Yin Yang, Wenqing Lin
2016 Proceedings of the VLDB Endowment  
Extensive experiments demonstrate that on continent-sized road networks, COLA answers an approximate CSP query in sub-second time, whereas existing methods take hours.  ...  In a constrained shortest path (CSP) query, each edge in the road network is associated with both a length and a cost.  ...  We then generate queries as follows: if the length of these two nodes is in range [dmin/2, +∞), we add it into Q5; if the distance is in range [dmin/4, dmin/2), we add it into Q4; if the distance is in  ... 
doi:10.14778/3015274.3015277 fatcat:52tb5wj7gngrte6zpz7yjskjji

Efficient Proximity Computation Techniques Using ZIP Code Data for Smart Cities †

Muhammad Murdani, Joonho Kwon, Yoon-Ho Choi, Bonghee Hong
2018 Sensors  
Our experimental results indicate that our approaches are verifiable and effective in reducing the execution time and search space. Table 3. Research on a minimum distance computation algorithm.  ...  In this paper, we are interested in computing ZIP code proximity from two perspectives, proximity between two ZIP codes (Ad-Hoc) and neighborhood proximity (Top-K).  ...  Dijkstra with a priority queue implementing Fibonacci Heap runs in O = (E + V log V) time.  ... 
doi:10.3390/s18040965 pmid:29587366 pmcid:PMC5948496 fatcat:wq3inkof3rc67bpjejfjtduhim

Management of Historical Information and Preference in Massive Datasets

Ανδρέας Κ. Κοσματόπουλος
More specifically, the first part of the thesis deals with the dynamic maintenance of top-k dominating points and the evaluation of dynamic 3-sided skyline queries in the presence of dataset updates.  ...  It is important, therefore, for solutions that target problems in this modern environment to be largely space efficient while retaining their time efficiency.  ...  Papadopoulos, Spyros Sioutas, Kostas Tsichlas, Dimitrios Tsoumakos: Dynamic Planar Range Skyline Queries in Loglogarithmic Expected Time.  ... 
doi:10.26262/ fatcat:x2bz6fvptbbeto37ekg3jjhnxm

Interoperability, XML Schema [chapter]

2017 Encyclopedia of GIS  
A (predictive) range query returns the objects expected to appear (based on their motion parameters) in a moving rectangle q at some time within a future time interval qt.  ...  Given a static set of N points in d -dimensions and an O.N / memory space, this technique answers any simplex range query in O.N 1=d C© C K/ time after an O.N log N / preprocessing time for any constant  ...  Cross-References Visual Momentum Information Retrieval Internet-Based Spatial Information Retrieval Retrieval Algorithms, Spatial Skyline Queries Information Theory Data Compression for Network GIS  ... 
doi:10.1007/978-3-319-17885-1_100625 fatcat:bgxdhdxa4bewzcggrogz56rdpi

Proceedings of eNTERFACE 2015 Workshop on Intelligent Interfaces [article]

Matei Mancas, Christian Frisson, Joëlle Tilmanne, Nicolas d'Alessandro, Petr Barborka, Furkan Bayansar, Francisco Bernard, Rebecca Fiebrink, Alexis Heloir, Edgar Hemery, Sohaib Laraba, Alexis Moinet (+58 others)
2018 arXiv   pre-print
During the four weeks, students and researchers from all over the world came together in the Numediart Institute of the University of Mons to work on eight selected projects structured around intelligent  ...  , and pleasure) with dynamic time warping classifiers.  ...  Another issue relates to the fact that users will become more accustomed and expecting real-time feedback when formulating queries, as is already the case with text queries.  ... 
arXiv:1801.06349v1 fatcat:qauytivdq5axxis2xlknp3r2ne

Mining latent entity structures from massive unstructured and interconnected data

Jiawei Han, Chi Wang
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
The "big data" era is characterized by an explosion of information in the form of digital data collections, ranging from scientific knowledge, to social media, news, and everyone's daily life.  ...  Valuable knowledge about multi-typed entities is often hidden in the unstructured or loosely structured but interconnected data.  ...  By using proper data structures, the contiguous pair with the highest significance can be selected and merged in logarithmic time, O(log(l d )) for each document.  ... 
doi:10.1145/2588555.2588890 dblp:conf/sigmod/HanW14 fatcat:js7d3r5yd5gbfgnhjgwsfmco2i

Advanced Indexing and Query Processing for Multidimensional Databases

Evangelos Dellis, Seeger, Bernhard (Prof. Dr.), Datenbanksysteme
Therefore, the general goal of this thesis is the improvement of the efficiency of index based query processing in high-dimensional data spaces and the development of novel query operators.  ...  To support efficient query processing in these high dimensional databases, high-dimensional indexes are required to prune the search space and efficient query processing strategies employing these indexes  ...  For independent dimensions the expected number of skyline points is θ((log N ) d−1 /(d − 1)!)  ... 
doi:10.17192/z2007.0676 fatcat:j666c7iplfckrldebinxaa4s5y

Flexible Network Design Dagstuhl Seminar

Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer
Dagstuhl Seminar Proceedings   unpublished
The rst section describes the seminar topics and goals in general.  ...  access pattern especially in the context of mobile and adhoc networks.  ...  We show how to answer such queries in constant time with O(n log 5 n) preprocessing time and O(n log n) space. We use a Gomory-Hu tree to represent all the pairwise min cuts implicitly.  ... 

Downloadable Full Issue

2020 Hungarian Journal of Industry and Chemistry  
In order to describe the dynamical properties of the system, time constants were measured at different speeds and magnetic inductions.  ...  The vehicle dynamics-based model only includes calculation of the lateral force and planar motion of the vehicle resulting in the minimal state-space model and filter algorithm.  ...  We would like to thank Zoltán Lukács and Tamás Kristóf to support conducting EIS measurements in the laboratory of Faculty of Physical Chemistry and sharing their knowledge in electrochemical modeling.  ... 
doi:10.33927/931 fatcat:pgjn46w74vb5djx3koev7lnsty

Data processing on heterogeneous hardware [article]

Max Heimel, Technische Universität Berlin, Technische Universität Berlin, Volker Markl
In dieser Arbeit stellen wir unsere Forschungsbeiträge zu diesem Bereich vor.  ...  In particular, we discuss the following two major topics: In the first part of this thesis, we discuss how to manage hardware heterogeneity by reducing the development overhead to implement a database  ...  Note the logarithmic x-axis. Figure 4 . 16 : 416 Evaluating the estimation cost of online, query-driven bandwidth selection for Kernel Density Models. Note the log-log scale.  ... 
doi:10.14279/depositonce-7255 fatcat:ymjwoicorzaylpwzkjktvmhjge

Building Blocks for Mapping Services

Dennis Luxen
When a logarithm is given without base we assume that it is the logarithm to base 2, i.e. log n ⌘ log 2 n.  ...  in time O(n log n).  ...  It generates the history for a range of time and if start and end UNIX timestamp of that range equal, it generates the planet file for that particular timestamp.  ... 
doi:10.5445/ir/1000035705 fatcat:v7jsoazyfnd7ng64pxkgk64tim

Algorithm Engineering for fundamental Sorting and Graph Problems

Vitaly Osipov
It is a set of basic techniques one can find in any (good) coursebook on algorithms and data structures.  ...  In this thesis we try to close the gap between theoretically worst-case optimal classical algorithms and the real-world circumstances one face under the assumptions imposed by the data size, limited main  ...  Also thanks are due to Dominik Schultes and Roman Dementiev for their help in using the external MST implementation and STXXL, respectively.  ... 
doi:10.5445/ir/1000042377 fatcat:72infiexarhixk6vxfg6b7op4i

Globalizing Domain-Specific Languages (Dagstuhl Seminar 14412) Optimal Algorithms and Proofs (Dagstuhl Seminar 14421) Modeling, Verification, and Control of Complex Systems for Energy Networks (Dagstuhl Seminar 14441) Symbolic Execution and Constraint Solving (Dagstuhl Seminar 14442)

Luc De Raedt, Siegfried Nijssen, Barry O'sullivan, Michele, Betty Cheng, Benoit Combemale, Robert France, Jean-Marc Jézéquel, Bernhard Rumpe, Olaf Beyersdorff, Edward Hirsch, Jan Krajíček (+9 others)
2014 Constraints   unpublished
their expected life times.  ...  Time constants range from milliseconds to several years, leading to temporal complexity.  ...  timely acquisition, processing and decision making based on "real-time" info.  ... 
« Previous Showing results 1 — 15 out of 22 results