Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             132 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 ABC of order dependencies Li, Pei

5 p. 825-849
artikel
2 A benchmark and comprehensive survey on knowledge graph entity alignment via representation learning Zhang, Rui

5 p. 1143-1168
artikel
3 ABSTAT-HD: a scalable tool for profiling very large knowledge graphs Alva Principe, Renzo Arturo

5 p. 851-876
artikel
4 A comparative survey of recent natural language interfaces for databases Affolter, Katrin
2019
5 p. 793-819
artikel
5 Active learning in keyword search-based data integration Yan, Zhepeng
2015
5 p. 611-631
artikel
6 Adding data provenance support to Apache Spark Interlandi, Matteo
2017
5 p. 595-615
artikel
7 A distributed in-memory key-value store system on heterogeneous CPU–GPU cluster Zhang, Kai
2017
5 p. 729-750
artikel
8 A model and query language for temporal graph databases Debrouvier, Ariel

5 p. 825-858
artikel
9 A motion-aware approach for efficient evaluation of continuous queries on 3D object databases Ali, Mohammed Eunus
2010
5 p. 603-632
artikel
10 A multi-resolution surface distance model for k-NN query processing Deng, Ke
2007
5 p. 1101-1119
artikel
11 Answering exact distance queries on real-world graphs with bounded performance guarantees Xiang, Yang
2013
5 p. 677-695
artikel
12 Applications of corpus-based semantic similarity and word segmentation to database schema matching Islam, Aminul
2007
5 p. 1293-1320
artikel
13 Architecture of a distributed storage that combines file system, memory and computation in a single layer Zou, Jia

5 p. 1049-1073
artikel
14 A survey of data replication techniques for mobile ad hoc network databases Padmanabhan, Prasanna
2008
5 p. 1143-1164
artikel
15 A survey on outlier explanations Panjei, Egawati

5 p. 977-1008
artikel
16 Augmented lineage: traceability of data analysis including complex UDF processing Yamada, Masaya

5 p. 963-983
artikel
17 Butterfly counting and bitruss decomposition on uncertain bipartite graphs Zhou, Alexander

5 p. 1013-1036
artikel
18 Characterization of the Impact of Hardware Islands on OLTP Porobic, Danica
2015
5 p. 625-650
artikel
19 CLARO: modeling and processing uncertain data streams Tran, Thanh T. L.
2011
5 p. 651-676
artikel
20 ClouDiA: a deployment advisor for public clouds Zou, Tao
2015
5 p. 633-653
artikel
21 Compressed linear algebra for large-scale machine learning Elgohary, Ahmed
2017
5 p. 719-744
artikel
22 Context-aware, preference-based vehicle routing Guo, Chenjuan

5 p. 1149-1170
artikel
23 Correction: A survey of community search over big graphs Fang, Yixiang

5 p. 1219
artikel
24 Correction to: Internal and external memory set containment join Yang, Chengcheng

5 p. 907
artikel
25 Creating probabilistic databases from duplicated data Hassanzadeh, Oktie
2009
5 p. 1141-1166
artikel
26 Data distribution debugging in machine learning pipelines Grafberger, Stefan

5 p. 1103-1126
artikel
27 Deep treatment-adaptive network for causal inference Li, Qian

5 p. 1127-1142
artikel
28 Detecting anomalous access patterns in relational databases Kamra, Ashish
2007
5 p. 1063-1077
artikel
29 Direction-based surrounder queries for mobile recommendations Guo, Xi
2011
5 p. 743-766
artikel
30 Diversified spatial keyword search on RDF data Cai, Zhi

5 p. 1171-1189
artikel
31 Dynamic monitoring of optimal locations in road network databases Yao, Bin
2013
5 p. 697-720
artikel
32 DynQ: a dynamic query engine with query-reuse capabilities embedded in a polyglot runtime Schiavio, Filippo

5 p. 1111-1135
artikel
33 Eccentricities on small-world networks Li, Wentao
2019
5 p. 765-792
artikel
34 Efficient (α, β)-core computation in bipartite graphs Liu, Boge

5 p. 1075-1099
artikel
35 Efficient evaluation of generalized tree-pattern queries on XML streams Wu, Xiaoying
2010
5 p. 661-686
artikel
36 Efficient generation of query plans containing group-by, join, and groupjoin Eich, Marius
2017
5 p. 617-641
artikel
37 Efficient Hop-constrained s-t Simple Path Enumeration Peng, You

5 p. 799-823
artikel
38 Efficient k-nearest neighbor search on moving object trajectories Güting, Ralf Hartmut
2010
5 p. 687-714
artikel
39 Efficiently processing snapshot and continuous reverse k nearest neighbors queries Cheema, Muhammad Aamir
2012
5 p. 703-728
artikel
40 Efficient maximum clique computation and enumeration over large sparse graphs Chang, Lijun

5 p. 999-1022
artikel
41 Efficient real-time trajectory tracking Lange, Ralph
2011
5 p. 671-694
artikel
42 Efficient temporal counting with bounded error Tao, Yufei
2007
5 p. 1271-1292
artikel
43 Efficient two-dimensional Haar$$^+$$+ synopsis construction for the maximum absolute error measure Kim, Jinhyun
2019
5 p. 675-701
artikel
44 Engineering scalable, cache and space efficient tries for strings Askitis, Nikolas
2010
5 p. 633-660
artikel
45 Enhancing data utility in differential privacy via microaggregation-based $$k$$k-anonymity Soria-Comas, Jordi
2014
5 p. 771-794
artikel
46 Enhancing histograms by tree-like bucket indices Buccafurri, Francesco
2007
5 p. 1041-1061
artikel
47 Enhancing online video recommendation using social user interactions Zhou, Xiangmin
2017
5 p. 637-656
artikel
48 eRiskCom: an e-commerce risky community detection platform Liu, Fanzhen

5 p. 1085-1101
artikel
49 Evaluating pattern matching queries for spatial databases Fang, Yixiang
2019
5 p. 649-673
artikel
50 Exploiting domain knowledge to address class imbalance and a heterogeneous feature space in multi-class classification Hirsch, Vitali

5 p. 1037-1064
artikel
51 Exploiting SSDs in operational multiversion databases Sadoghi, Mohammad
2015
5 p. 651-672
artikel
52 Fast-adapting and privacy-preserving federated recommender system Wang, Qinyong

5 p. 877-896
artikel
53 Fast and accurate stream processing by filtering the cold Yang, Tong
2019
5 p. 735-763
artikel
54 FERRARI: an efficient framework for visual exploratory subgraph search in graph databases Wang, Chaohui

5 p. 973-998
artikel
55 Finding k-shortest paths with limited overlap Chondrogiannis, Theodoros

5 p. 1023-1047
artikel
56 Flash as cache extension for online transactional workloads Kang, Woon-Hak
2015
5 p. 673-694
artikel
57 Formal semantics and high performance in declarative machine learning using Datalog Wang, Jin

5 p. 859-881
artikel
58 gbase: an efficient analysis platform for large graphs Kang, U
2012
5 p. 637-650
artikel
59 General graph generators: experiments, analyses, and improvements Xiang, Sheng

5 p. 897-925
artikel
60 Geo-social group queries with minimum acquaintance constraints Zhu, Qijun
2017
5 p. 709-727
artikel
61 GPU-accelerated string matching for database applications Sitaridi, Evangelia A.
2015
5 p. 719-740
artikel
62 Graph repairing under neighborhood constraints Song, Shaoxu
2017
5 p. 611-635
artikel
63 Guided perturbation: towards private and accurate mining Zhong, Sheng
2007
5 p. 1165-1177
artikel
64 Indexing in-network trajectory flows Sandu Popa, Iulian
2011
5 p. 643-669
artikel
65 Information Resilience: the nexus of responsible and agile approaches to information use Sadiq, Shazia

5 p. 1059-1084
artikel
66 I/O efficient k-truss community search in massive graphs Jiang, Yuli

5 p. 713-738
artikel
67 Learned sketch for subgraph counting: a holistic approach Zhao, Kangfei

5 p. 937-962
artikel
68 Leveraging user itinerary to improve personalized deep matching at Fliggy Xu, Jia

5 p. 1065-1086
artikel
69 Location prediction in large-scale social networks: an in-depth benchmarking study Al Hasan Haldar, Nur
2019
5 p. 623-648
artikel
70 Maintaining very large random samples using the geometric file Pol, Abhijit
2007
5 p. 997-1018
artikel
71 Managing bias and unfairness in data for decision support: a survey of machine learning and data engineering approaches to identify and mitigate bias and unfairness within data management and analytics systems Balayn, Agathe

5 p. 739-768
artikel
72 Many-query join: efficient shared execution of relational joins on modern hardware Makreshanski, Darko
2017
5 p. 669-692
artikel
73 MDDE: multitasking distributed differential evolution for privacy-preserving database fragmentation Ge, Yong-Feng

5 p. 957-975
artikel
74 Measuring structural similarity of semistructured data based on information-theoretic approaches Helmer, Sven
2012
5 p. 677-702
artikel
75 Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs Shao, Yingxia

5 p. 769-797
artikel
76 Mining top-k frequent patterns in the presence of the memory constraint Chuang, Kun-Ta
2007
5 p. 1321-1344
artikel
77 On entity alignment at scale Zeng, Weixin

5 p. 1009-1033
artikel
78 On the expressiveness of probabilistic XML models Abiteboul, Serge
2009
5 p. 1041-1064
artikel
79 On the optimization of schedules for MapReduce workloads in the presence of shared scans Wolf, Joel
2012
5 p. 589-609
artikel
80 On the performance and convergence of distributed stream processing via approximate fault tolerance Cheng, Zhinan
2019
5 p. 821-846
artikel
81 Package queries: efficient and scalable computation of high-order constraints Brucato, Matteo
2017
5 p. 693-718
artikel
82 Payment behavior prediction on shared parking lots with TR-GCN Xu, Qingyu

5 p. 1035-1058
artikel
83 Picket: guarding against corrupted data in tabular data during learning and inference Liu, Zifan

5 p. 927-955
artikel
84 Power-law relationship and self-similarity in the itemset support distribution: analysis and applications Chuang, Kun-Ta
2007
5 p. 1121-1141
artikel
85 (p,q)-biclique counting and enumeration for large sparse bipartite graphs Yang, Jianye

5 p. 1137-1161
artikel
86 PrDB: managing and exploiting rich correlations in probabilistic databases Sen, Prithviraj
2009
5 p. 1065-1090
artikel
87 Predicate-based indexing for desktop search Duda, Cristian
2010
5 p. 735-758
artikel
88 Primal or dual: which promises faster spatiotemporal search? Tao, Yufei
2007
5 p. 1253-1270
artikel
89 Processing of extreme moving-object update and query workloads in main memory Šidlauskas, Darius
2014
5 p. 817-841
artikel
90 Qualitative effects of knowledge rules and user feedback in probabilistic data integration Keulen, Maurice van
2009
5 p. 1191-1217
artikel
91 Query-aware locality-sensitive hashing scheme for $$l_p$$lp norm Huang, Qiang
2017
5 p. 683-708
artikel
92 Query evaluation over probabilistic XML Kimelfeld, Benny
2009
5 p. 1117-1140
artikel
93 Query optimization through the looking glass, and what we found running the Join Order Benchmark Leis, Viktor
2017
5 p. 643-668
artikel
94 Query processing over incomplete autonomous databases: query rewriting using learned data dependencies Wolf, Garrett
2009
5 p. 1167-1190
artikel
95 Query reverse engineering Tran, Quoc Trung
2013
5 p. 721-746
artikel
96 Ranking continuous nearest neighbors for uncertain trajectories Trajcevski, Goce
2011
5 p. 767-791
artikel
97 RDF graph summarization for first-sight structure discovery Goasdoué, François

5 p. 1191-1218
artikel
98 Read/write-optimized tree indexing for solid-state drives Jin, Peiquan
2015
5 p. 695-717
artikel
99 Reference-based indexing for metric spaces with costly distance measures Venkateswaran, Jayendra
2007
5 p. 1231-1251
artikel
100 Representing uncertain data: models, properties, and algorithms Sarma, Anish Das
2009
5 p. 989-1019
artikel
101 Scalable processing of snapshot and continuous nearest-neighbor queries over one-dimensional uncertain data Chen, Jinchuan
2009
5 p. 1219-1240
artikel
102 Scheduled approximation for Personalized PageRank with Utility-based Hub Selection Zhu, Fanwei
2015
5 p. 655-679
artikel
103 SCOPE: parallel databases meet MapReduce Zhou, Jingren
2012
5 p. 611-636
artikel
104 Secret sharing for cloud data security: a survey Attasena, Varunya
2017
5 p. 657-681
artikel
105 SEPIA: estimating selectivities of approximate string predicates in large Databases Jin, Liang
2008
5 p. 1213-1229
artikel
106 Sequenced spatiotemporal aggregation for coarse query granularities Timko, Igor
2011
5 p. 721-741
artikel
107 SKCompress: compressing sparse and nonuniform gradient in distributed machine learning Jiang, Jiawei

5 p. 945-972
artikel
108 Sliding window-based approximate triangle counting with bounded memory usage Gou, Xiangyang

5 p. 1087-1110
artikel
109 SOLE: scalable on-line execution of continuous queries on spatio-temporal data streams Mokbel, Mohamed F.
2007
5 p. 971-995
artikel
110 Spatial query processing for fuzzy objects Zheng, Kai
2012
5 p. 729-751
artikel
111 Special Issue: Modern Hardware Boncz, Peter
2016
5 p. 623-624
artikel
112 Special issue on best papers of VLDB 2016 Chaudhuri, Surajit
2018
5 p. 593-594
artikel
113 Special issue on best papers of VLDB 2013 Böhlen, Michael H.
2015
5 p. 609-610
artikel
114 Special issue on data management for mobile services Güting, Ralf Hartmut
2011
5 p. 641-642
artikel
115 Special issue on responsible data management and data science Huang, Zi

5 p. 823
artikel
116 Special issue on uncertain and probabilistic databases Haas, Peter J.
2009
5 p. 987-988
artikel
117 Special section on large-scale analytics Lehner, Wolfgang
2012
5 p. 587-588
artikel
118 SRX: efficient management of spatial RDF data Theocharidis, Konstantinos
2019
5 p. 703-733
artikel
119 Survey of window types for aggregation in stream processing systems Verwiebe, Juliane

5 p. 985-1011
artikel
120 Taking the Big Picture: representative skylines based on significance and diversity Magnani, Matteo
2014
5 p. 795-815
artikel
121 Taxonomy-based relaxation of query answering in relational databases Martinenghi, Davide
2014
5 p. 747-769
artikel
122 Temporal XML: modeling, indexing, and query processing Rizzolo, Flavio
2007
5 p. 1179-1212
artikel
123 The Active XML project: an overview Abiteboul, Serge
2007
5 p. 1019-1040
artikel
124 The trichotomy of HAVING queries on a probabilistic database Ré, Christopher
2009
5 p. 1091-1116
artikel
125 Tidy Tuples and Flying Start: fast compilation and fast execution of relational queries in Umbra Kersten, Timo

5 p. 883-905
artikel
126 Top-k queries on temporal data Li, Feifei
2010
5 p. 715-733
artikel
127 Top-k term publish/subscribe for geo-textual data streams Chen, Lisi

5 p. 1101-1128
artikel
128 TurboLift: fast accuracy lifting for historical data recovery Yang, Fan

5 p. 1129-1148
artikel
129 Unveiling the complexity of human mobility by querying and mining massive trajectory data Giannotti, Fosca
2011
5 p. 695-719
artikel
130 VLL: a lock manager redesign for main memory database systems Ren, Kun
2015
5 p. 681-705
artikel
131 Wavelet synopsis for hierarchical range queries with workloads Guha, Sudipto
2007
5 p. 1079-1099
artikel
132 $${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information Antova, Lyublena
2009
5 p. 1021-1040
artikel
                             132 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland