| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Accelerating multi-way joins on the GPU
|
Lai, Zhuohang
|
|
|
|
3 |
p. 529-553
|
artikel
|
| 2 |
Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning
|
Harbi, Razen
|
|
2016
|
|
3 |
p. 355-380
|
artikel
|
| 3 |
Access path support for referential integrity in SQL2
|
Härder, Theo
|
|
1996
|
|
3 |
p. 196-214
|
artikel
|
| 4 |
A complete temporal relational algebra
|
Dey, Debabrata
|
|
1996
|
|
3 |
p. 167-180
|
artikel
|
| 5 |
Adaptive, unsupervised stream mining
|
Papadimitriou, Spiros
|
|
2004
|
|
3 |
p. 222-239
|
artikel
|
| 6 |
A database model for object dynamics
|
Papazoglou, M.P.
|
|
1997
|
|
3 |
p. 257-260
|
artikel
|
| 7 |
A formal perspective on the view selection problem
|
Chirkova, Rada
|
|
2002
|
|
3 |
p. 216-237
|
artikel
|
| 8 |
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
|
Nutanong, Sarana
|
|
2009
|
|
3 |
p. 307-332
|
artikel
|
| 9 |
An authorization model for query execution in the cloud
|
De Capitani di Vimercati, Sabrina
|
|
|
|
3 |
p. 555-579
|
artikel
|
| 10 |
Answering queries using materialized views with minimum size
|
Chirkova, Rada
|
|
2005
|
|
3 |
p. 191-210
|
artikel
|
| 11 |
A Pareto optimal Bloom filter family with hash adaptivity
|
Li, Meng
|
|
|
|
3 |
p. 525-548
|
artikel
|
| 12 |
A performance study of four index structures for set-valued attributes of low cardinality
|
Helmer, Sven
|
|
2003
|
|
3 |
p. 244-261
|
artikel
|
| 13 |
Approximate similarity search for online multimedia services on distributed CPU–GPU platforms
|
Teodoro, George
|
|
2013
|
|
3 |
p. 427-448
|
artikel
|
| 14 |
A self-adaptable query allocation framework for distributed information systems
|
Quiané-Ruiz, Jorge-Arnulfo
|
|
2008
|
|
3 |
p. 649-674
|
artikel
|
| 15 |
A survey of large-scale analytical query processing in MapReduce
|
Doulkeridis, Christos
|
|
2013
|
|
3 |
p. 355-380
|
artikel
|
| 16 |
A survey of RDF stores & SPARQL engines for querying knowledge graphs
|
Ali, Waqas
|
|
|
|
3 |
p. 1-26
|
artikel
|
| 17 |
A survey of skyline processing in highly distributed environments
|
Hose, Katja
|
|
2011
|
|
3 |
p. 359-384
|
artikel
|
| 18 |
Attribute grammars for scalable query processing on XML streams
|
Koch, Christoph
|
|
2006
|
|
3 |
p. 317-342
|
artikel
|
| 19 |
Authenticated indexing for outsourced spatial databases
|
Yang, Yin
|
|
2008
|
|
3 |
p. 631-648
|
artikel
|
| 20 |
AutoG: a visual query autocompletion framework for graph databases
|
Yi, Peipei
|
|
2017
|
|
3 |
p. 347-372
|
artikel
|
| 21 |
Automatic integration of Web search interfaces with WISE-Integrator
|
He, Hai
|
|
2004
|
|
3 |
p. 256-273
|
artikel
|
| 22 |
Bandwidth-constrained queries in sensor networks
|
Deligiannakis, Antonios
|
|
2006
|
|
3 |
p. 443-467
|
artikel
|
| 23 |
Best papers of VLDB 2003
|
Freytag, Johann-Christoph
|
|
2004
|
|
3 |
p. 205-206
|
artikel
|
| 24 |
Better database cost/performance via batched I/O on programmable SSD
|
Do, Jaeyoung
|
|
|
|
3 |
p. 403-424
|
artikel
|
| 25 |
Bitwise dimensional co-clustering for analytical workloads
|
Baumann, Stephan
|
|
2016
|
|
3 |
p. 291-316
|
artikel
|
| 26 |
Cache-efficient sweeping-based interval joins for extended Allen relation predicates
|
Piatov, Danila
|
|
|
|
3 |
p. 379-402
|
artikel
|
| 27 |
Cascade-aware partitioning of large graph databases
|
Demirci, Gunduz Vehbi
|
|
2018
|
|
3 |
p. 329-350
|
artikel
|
| 28 |
Cleaning timestamps with temporal constraints
|
Song, Shaoxu
|
|
|
|
3 |
p. 425-446
|
artikel
|
| 29 |
Comparison and evaluation of state-of-the-art LSM merge policies
|
Mao, Qizhong
|
|
|
|
3 |
p. 361-378
|
artikel
|
| 30 |
Composing, optimizing, and executing plans for bioinformatics web services
|
Thakkar, Snehal
|
|
2005
|
|
3 |
p. 330-353
|
artikel
|
| 31 |
Computing complete answers to queries in the presence of limited access patterns
|
Li, Chen
|
|
2003
|
|
3 |
p. 211-227
|
artikel
|
| 32 |
Computing weight constraint reachability in large networks
|
Qiao, Miao
|
|
2012
|
|
3 |
p. 275-294
|
artikel
|
| 33 |
Concurrency and recovery for index trees
|
Lomet, David
|
|
1997
|
|
3 |
p. 224-240
|
artikel
|
| 34 |
Conditional heavy hitters: detecting interesting correlations in data streams
|
Mirylenka, Katsiaryna
|
|
2015
|
|
3 |
p. 395-414
|
artikel
|
| 35 |
Context-based prefetch – an optimization for implementing objects on relations
|
Bernstein, Philip A.
|
|
2000
|
|
3 |
p. 177-189
|
artikel
|
| 36 |
Continuous monitoring of moving skyline and top-k queries
|
Hidayat, Arif
|
|
|
|
3 |
p. 459-482
|
artikel
|
| 37 |
Continuous visible nearest neighbor query processing in spatial databases
|
Gao, Yunjun
|
|
2010
|
|
3 |
p. 371-396
|
artikel
|
| 38 |
Cost-driven vertical class partitioning for methods in object oriented databases
|
Fung, Chi-Wai
|
|
2003
|
|
3 |
p. 187-210
|
artikel
|
| 39 |
Cost-effective conceptual design using taxonomies
|
Chodpathumwan, Yodsawalai
|
|
2018
|
|
3 |
p. 369-394
|
artikel
|
| 40 |
Database indexing for large DNA and protein sequence collections
|
Hunt, Ela
|
|
2002
|
|
3 |
p. 256-271
|
artikel
|
| 41 |
Data page layouts for relational databases on deep memory hierarchies
|
Ailamaki, Anastassia
|
|
2002
|
|
3 |
p. 198-215
|
artikel
|
| 42 |
Decorating the cloud: enabling annotation management in MapReduce
|
Lu, Yue
|
|
2016
|
|
3 |
p. 399-424
|
artikel
|
| 43 |
Dependency trees in sub-linear time and bounded memory
|
Pelleg, Dan
|
|
2006
|
|
3 |
p. 250-262
|
artikel
|
| 44 |
Deploying and managing Web services: issues, solutions, and directions
|
Yu, Qi
|
|
2006
|
|
3 |
p. 537-572
|
artikel
|
| 45 |
Disjoint interval partitioning
|
Cafagna, Francesco
|
|
2017
|
|
3 |
p. 447-466
|
artikel
|
| 46 |
Distributed shortest path query processing on dynamic road networks
|
Zhang, Dongxiang
|
|
2017
|
|
3 |
p. 399-419
|
artikel
|
| 47 |
Editorial
|
Apers, Peter
|
|
2002
|
|
3 |
p. 177-178
|
artikel
|
| 48 |
Efficient algorithms for mining maximal valid groups
|
Wang, Yida
|
|
2006
|
|
3 |
p. 515-535
|
artikel
|
| 49 |
Efficient distributed subgraph similarity matching
|
Yuan, Ye
|
|
2015
|
|
3 |
p. 369-394
|
artikel
|
| 50 |
Efficient $$k$$k-closest pair queries in general metric spaces
|
Gao, Yunjun
|
|
2015
|
|
3 |
p. 415-439
|
artikel
|
| 51 |
Efficient kNN query for moving objects on time-dependent road networks
|
Li, Jiajia
|
|
|
|
3 |
p. 575-594
|
artikel
|
| 52 |
Efficient local locking for massively multithreaded in-memory hash-based operators
|
Romanous, Bashar
|
|
|
|
3 |
p. 333-359
|
artikel
|
| 53 |
Efficient management of uncertainty in XML schema matching
|
Gong, Jian
|
|
2011
|
|
3 |
p. 385-409
|
artikel
|
| 54 |
Efficient processing of exact top-k queries over disk-resident sorted lists
|
Pang, HweeHwa
|
|
2009
|
|
3 |
p. 437-456
|
artikel
|
| 55 |
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
|
Lian, Xiang
|
|
2009
|
|
3 |
p. 787-808
|
artikel
|
| 56 |
Efficient structural graph clustering: an index-based approach
|
Wen, Dong
|
|
2019
|
|
3 |
p. 377-399
|
artikel
|
| 57 |
Efficient structural node similarity computation on billion-scale graphs
|
Chen, Xiaoshuang
|
|
|
|
3 |
p. 471-493
|
artikel
|
| 58 |
Efficient updates in dynamic XML data: from binary string to quaternary string
|
Li, Changqing
|
|
2006
|
|
3 |
p. 573-601
|
artikel
|
| 59 |
Enabling Schema-Free XQuery with meaningful query focus
|
Li, Yunyao
|
|
2006
|
|
3 |
p. 355-377
|
artikel
|
| 60 |
Enabling search services on outsourced private spatial data
|
Yiu, Man Lung
|
|
2009
|
|
3 |
p. 363-384
|
artikel
|
| 61 |
Energy-performance trade-offs for spatial access methods on memory-resident data
|
An, Ning
|
|
2002
|
|
3 |
p. 179-197
|
artikel
|
| 62 |
Enhanced abstract data types in object-relational databases
|
Seshadri, Praveen
|
|
1998
|
|
3 |
p. 130-140
|
artikel
|
| 63 |
Enhancing domain-aware multi-truth data fusion using copy-based source authority and value similarity
|
Azzalini, Fabio
|
|
|
|
3 |
p. 475-500
|
artikel
|
| 64 |
Equivalence of queries that are sensitive to multiplicities
|
Cohen, Sara
|
|
2009
|
|
3 |
p. 765-785
|
artikel
|
| 65 |
Event correlation for process discovery from web service interaction logs
|
Motahari-Nezhad, Hamid Reza
|
|
2010
|
|
3 |
p. 417-444
|
artikel
|
| 66 |
Event detection over twitter social media streams
|
Zhou, Xiangmin
|
|
2013
|
|
3 |
p. 381-400
|
artikel
|
| 67 |
Exact and approximate flexible aggregate similarity search
|
Li, Feifei
|
|
2015
|
|
3 |
p. 317-338
|
artikel
|
| 68 |
Exploiting early sorting and early partitioning for decision support query processing
|
Claussen, J.
|
|
2000
|
|
3 |
p. 190-213
|
artikel
|
| 69 |
Exploring the tradeoff between performance and data freshness in database-driven Web servers
|
Labrinidis, Alexandros
|
|
2004
|
|
3 |
p. 240-255
|
artikel
|
| 70 |
Fairness in rankings and recommendations: an overview
|
Pitoura, Evaggelia
|
|
|
|
3 |
p. 431-458
|
artikel
|
| 71 |
Fast fully dynamic labelling for distance queries
|
Farhan, Muhammad
|
|
|
|
3 |
p. 483-506
|
artikel
|
| 72 |
Finding lowest-cost paths in settings with safe and preferred zones
|
Aljubayrin, Saad
|
|
2017
|
|
3 |
p. 373-397
|
artikel
|
| 73 |
Form-based proxy caching for database-backed web sites: keywords and functions
|
Luo, Qiong
|
|
2006
|
|
3 |
p. 489-513
|
artikel
|
| 74 |
Garbage collection in object-oriented databases using transactional cyclic reference counting
|
Roy, P.
|
|
1998
|
|
3 |
p. 179-193
|
artikel
|
| 75 |
Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory
|
Li, Lei
|
|
2018
|
|
3 |
p. 321-345
|
artikel
|
| 76 |
Guest Editorial
|
Jarke, Matthias
|
|
1998
|
|
3 |
p. 129
|
artikel
|
| 77 |
Guest editorial
|
Atkinson, Malcolm P.
|
|
2000
|
|
3 |
p. 175-176
|
artikel
|
| 78 |
HERMES: data placement and schema optimization for enterprise knowledge bases
|
Lei, Chuan
|
|
|
|
3 |
p. 549-574
|
artikel
|
| 79 |
Heuristic and randomized optimization for the join ordering problem
|
Steinbrunn, Michael
|
|
1997
|
|
3 |
p. 191-208
|
artikel
|
| 80 |
High efficiency and quality: large graphs matching
|
Zhu, Yuanyuan
|
|
2012
|
|
3 |
p. 345-368
|
artikel
|
| 81 |
Histograms based on the minimum description length principle
|
Wang, Hai
|
|
2006
|
|
3 |
p. 419-442
|
artikel
|
| 82 |
Hybrid query optimization for hard-to-compress bit-vectors
|
Guzun, Gheorghi
|
|
2015
|
|
3 |
p. 339-354
|
artikel
|
| 83 |
Incremental computation and maintenance of temporal aggregates
|
Yang, Jun
|
|
2003
|
|
3 |
p. 262-283
|
artikel
|
| 84 |
Incremental k-core decomposition: algorithms and evaluation
|
Sarıyüce, Ahmet Erdem
|
|
2016
|
|
3 |
p. 425-447
|
artikel
|
| 85 |
Incremental maintenance of maximal cliques in a dynamic graph
|
Das, Apurba
|
|
2019
|
|
3 |
p. 351-375
|
artikel
|
| 86 |
Index design and query processing for graph conductance search
|
Chakrabarti, Soumen
|
|
2010
|
|
3 |
p. 445-470
|
artikel
|
| 87 |
Index nesting – an efficient approach to indexing in object-oriented databases
|
Ooi, Beng Chin
|
|
1996
|
|
3 |
p. 215-228
|
artikel
|
| 88 |
Instance-based attribute identification in database integration
|
Chua, Cecil Eng H.
|
|
2003
|
|
3 |
p. 228-243
|
artikel
|
| 89 |
Instance optimal query processing in spatial networks
|
Deng, Ke
|
|
2008
|
|
3 |
p. 675-693
|
artikel
|
| 90 |
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
|
Kraiss, Achim
|
|
1998
|
|
3 |
p. 141-162
|
artikel
|
| 91 |
Integrating reliable memory in databases
|
Ng, Wee Teck
|
|
1998
|
|
3 |
p. 194-204
|
artikel
|
| 92 |
Internal and external memory set containment join
|
Yang, Chengcheng
|
|
|
|
3 |
p. 447-470
|
artikel
|
| 93 |
Learning-based query optimization for multi-probe approximate nearest neighbor search
|
Zhang, Pengcheng
|
|
|
|
3 |
p. 623-645
|
artikel
|
| 94 |
Log-based middleware server recovery with transaction support
|
Wang, Rui
|
|
2010
|
|
3 |
p. 347-370
|
artikel
|
| 95 |
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries
|
Bonifati, Angela
|
|
2016
|
|
3 |
p. 381-397
|
artikel
|
| 96 |
Mining learning-dependency between knowledge units from text
|
Liu, Jun
|
|
2010
|
|
3 |
p. 335-345
|
artikel
|
| 97 |
Multi-constraint shortest path using forest hop labeling
|
Liu, Ziyi
|
|
|
|
3 |
p. 595-621
|
artikel
|
| 98 |
Multidimensional reverse kNN search
|
Tao, Yufei
|
|
2005
|
|
3 |
p. 293-316
|
artikel
|
| 99 |
Multi-dimensional top-k dominating queries
|
Yiu, Man Lung
|
|
2008
|
|
3 |
p. 695-718
|
artikel
|
| 100 |
Nearest and reverse nearest neighbor queries for moving objects
|
Benetis, Rimantas
|
|
2006
|
|
3 |
p. 229-249
|
artikel
|
| 101 |
One-dimensional and multi-dimensional substring selectivity estimation
|
Jagadish, H.V.
|
|
2000
|
|
3 |
p. 214-230
|
artikel
|
| 102 |
Online dynamic reordering
|
Raman, Vijayshankar
|
|
2000
|
|
3 |
p. 247-260
|
artikel
|
| 103 |
On-line rule matching for event prediction
|
Cho, Chung-Wen
|
|
2010
|
|
3 |
p. 303-334
|
artikel
|
| 104 |
Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings
|
Bača, Radim
|
|
2012
|
|
3 |
p. 369-393
|
artikel
|
| 105 |
Optimization and evaluation of shortest path queries
|
Chan, Edward P. F.
|
|
2006
|
|
3 |
p. 343-369
|
artikel
|
| 106 |
Optimizing database architecture for the new bottleneck: memory access
|
Manegold, Stefan
|
|
2000
|
|
3 |
p. 231-246
|
artikel
|
| 107 |
Parallel replication across formats for scaling out mixed OLTP/OLAP workloads in main-memory databases
|
Lee, Juchang
|
|
2018
|
|
3 |
p. 421-444
|
artikel
|
| 108 |
Parallel trajectory similarity joins in spatial networks
|
Shang, Shuo
|
|
2018
|
|
3 |
p. 395-420
|
artikel
|
| 109 |
PARROT: pattern-based correlation exploitation in big partitioned data series
|
Zhang, Liang
|
|
|
|
3 |
p. 665-688
|
artikel
|
| 110 |
Parsimonious temporal aggregation
|
Gordevičius, Juozas
|
|
2011
|
|
3 |
p. 309-332
|
artikel
|
| 111 |
Path-based holistic detection plan for multiple patterns in distributed graph frameworks
|
Gao, Jun
|
|
2017
|
|
3 |
p. 327-345
|
artikel
|
| 112 |
Pattern discovery in data streams under the time warping distance
|
Toyoda, Machiko
|
|
2012
|
|
3 |
p. 295-318
|
artikel
|
| 113 |
Personalized trajectory matching in spatial networks
|
Shang, Shuo
|
|
2013
|
|
3 |
p. 449-468
|
artikel
|
| 114 |
Practical methods for constructing suffix trees
|
Tian, Yuanyuan
|
|
2005
|
|
3 |
p. 281-299
|
artikel
|
| 115 |
Predicting WWW surfing using multiple evidence combination
|
Awad, Mamoun
|
|
2006
|
|
3 |
p. 401-417
|
artikel
|
| 116 |
Preserving mapping consistency under schema changes
|
Velegrakis, Yannis
|
|
2004
|
|
3 |
p. 274-293
|
artikel
|
| 117 |
Privacy and efficiency guaranteed social subgraph matching
|
Huang, Kai
|
|
|
|
3 |
p. 581-602
|
artikel
|
| 118 |
Progressive evaluation of nested aggregate queries
|
Tan, Kian-Lee
|
|
2000
|
|
3 |
p. 261-278
|
artikel
|
| 119 |
QFilter: rewriting insecure XML queries to secure ones using non-deterministic finite automata
|
Luo, Bo
|
|
2010
|
|
3 |
p. 397-415
|
artikel
|
| 120 |
QUBLE: towards blending interactive visual subgraph search queries on large networks
|
Hung, Ho Hoang
|
|
2013
|
|
3 |
p. 401-426
|
artikel
|
| 121 |
Query optimization in XML structured-document databases
|
Che, Dunren
|
|
2005
|
|
3 |
p. 263-289
|
artikel
|
| 122 |
Query processing of multi-way stream window joins
|
Hammad, Moustafa A.
|
|
2006
|
|
3 |
p. 469-488
|
artikel
|
| 123 |
Real-time creation of bitmap indexes on streaming network data
|
Fusco, Francesco
|
|
2011
|
|
3 |
p. 287-307
|
artikel
|
| 124 |
Reasoning with patterns to effectively answer XML keyword queries
|
Aksoy, Cem
|
|
2015
|
|
3 |
p. 441-465
|
artikel
|
| 125 |
Reducing outer joins
|
Hill, Gerhard
|
|
2008
|
|
3 |
p. 599-610
|
artikel
|
| 126 |
Reverse spatial top-k keyword queries
|
Ahmed, Pritom
|
|
|
|
3 |
p. 501-524
|
artikel
|
| 127 |
RNE: computing shortest paths using road network embedding
|
Zhao, Tianyu
|
|
|
|
3 |
p. 507-528
|
artikel
|
| 128 |
Rule-based workflow management for bioinformatics
|
Conery, John S.
|
|
2005
|
|
3 |
p. 318-329
|
artikel
|
| 129 |
Scalable feature selection, classification and signature generation for organizing large text databases into hierarchical topic taxonomies
|
Chakrabarti, Soumen
|
|
1998
|
|
3 |
p. 163-178
|
artikel
|
| 130 |
Scalable subgraph enumeration in MapReduce: a cost-oriented approach
|
Lai, Longbin
|
|
2017
|
|
3 |
p. 421-446
|
artikel
|
| 131 |
Scaling distributed transaction processing and recovery based on dependency logging
|
Yao, Chang
|
|
2018
|
|
3 |
p. 347-368
|
artikel
|
| 132 |
Secure multidimensional range queries over outsourced data
|
Hore, Bijit
|
|
2011
|
|
3 |
p. 333-358
|
artikel
|
| 133 |
Seeking the truth about ad hoc join costs
|
Haas, Laura M.
|
|
1997
|
|
3 |
p. 241-256
|
artikel
|
| 134 |
Self-tuning management of update-intensive multidimensional data in clusters of workstations
|
Kriakov, Vassil
|
|
2009
|
|
3 |
p. 739-764
|
artikel
|
| 135 |
Semantic embedding for regions of interest
|
Paul, Debjyoti
|
|
|
|
3 |
p. 311-331
|
artikel
|
| 136 |
Service oriented architectures: approaches, technologies and research issues
|
Papazoglou, Mike P.
|
|
2007
|
|
3 |
p. 389-415
|
artikel
|
| 137 |
Similarity queries: their conceptual evaluation, transformations, and processing
|
Silva, Yasin N.
|
|
2012
|
|
3 |
p. 395-420
|
artikel
|
| 138 |
SimRank*: effective and scalable pairwise similarity search based on graph topology
|
Yu, Weiren
|
|
2019
|
|
3 |
p. 401-426
|
artikel
|
| 139 |
Sketching distributed sliding-window data streams
|
Papapetrou, Odysseas
|
|
2015
|
|
3 |
p. 345-368
|
artikel
|
| 140 |
Sliding-window top-k queries on uncertain streams
|
Jin, Cheqing
|
|
2009
|
|
3 |
p. 411-435
|
artikel
|
| 141 |
Sort-sharing-aware query processing
|
Cao, Yu
|
|
2011
|
|
3 |
p. 411-436
|
artikel
|
| 142 |
Spatio-temporal data reduction with deterministic error bounds
|
Cao, Hu
|
|
2006
|
|
3 |
p. 211-228
|
artikel
|
| 143 |
Spatio-textual user matching and clustering based on set similarity joins
|
Belesiotis, Alexandros
|
|
2018
|
|
3 |
p. 297-320
|
artikel
|
| 144 |
Special issue on data management, analysis, and mining for the life sciences
|
Gaasterland, Terry
|
|
2005
|
|
3 |
p. 279-280
|
artikel
|
| 145 |
Summarizing semantic graphs: a survey
|
Čebirić, Šejla
|
|
2018
|
|
3 |
p. 295-327
|
artikel
|
| 146 |
Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures
|
Keogh, Eamonn
|
|
2008
|
|
3 |
p. 611-630
|
artikel
|
| 147 |
Supporting top-kjoin queries in relational databases
|
Ilyas, Ihab F.
|
|
2004
|
|
3 |
p. 207-221
|
artikel
|
| 148 |
Suppressing microdata to prevent classification based inference
|
Azgin Hintoglu, Ayça
|
|
2009
|
|
3 |
p. 385-410
|
artikel
|
| 149 |
Synchronization and recovery in a client-server storage system
|
Panagos, E.
|
|
1997
|
|
3 |
p. 209-223
|
artikel
|
| 150 |
Sync your data: update propagation for heterogeneous protein databases
|
Claypool, Kajal T.
|
|
2005
|
|
3 |
p. 300-317
|
artikel
|
| 151 |
The backchase revisited
|
Meier, Michael
|
|
2013
|
|
3 |
p. 495-516
|
artikel
|
| 152 |
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
|
Yiu, Man Lung
|
|
2006
|
|
3 |
p. 379-400
|
artikel
|
| 153 |
The BEA streaming XQuery processor
|
Florescu, Daniela
|
|
2004
|
|
3 |
p. 294-315
|
artikel
|
| 154 |
The design and implementation of K:a high-level knowledge-base programming language of OSAM*.KBMS
|
Shyy, Yuh-Ming
|
|
1996
|
|
3 |
p. 181-195
|
artikel
|
| 155 |
The dynamic predicate: integrating access control with query processing in XML databases
|
Lee, Jae-Gil
|
|
|
|
3 |
p. 371-387
|
artikel
|
| 156 |
The dynamic predicate: integrating access control with query processing in XML databases
|
Lee, Jae-Gil
|
|
2006
|
|
3 |
p. 371-387
|
artikel
|
| 157 |
The impact of object technology on commercial transaction processing
|
Cobb, Edward E.
|
|
1997
|
|
3 |
p. 173-190
|
artikel
|
| 158 |
Thematic issue on data management for graphs
|
Amer-Yahia, Sihem
|
|
2019
|
|
3 |
p. 293-294
|
artikel
|
| 159 |
The RUM-tree: supporting frequent updates in R-trees using memos
|
Silva, Yasin N.
|
|
2008
|
|
3 |
p. 719-738
|
artikel
|
| 160 |
Top-k spatial-keyword publish/subscribe over sliding window
|
Wang, Xiang
|
|
2017
|
|
3 |
p. 301-326
|
artikel
|
| 161 |
Top-K structural diversity search in large networks
|
Huang, Xin
|
|
2015
|
|
3 |
p. 319-343
|
artikel
|
| 162 |
Top-k typicality queries and efficient query answering methods on large databases
|
Hua, Ming
|
|
2009
|
|
3 |
p. 809-835
|
artikel
|
| 163 |
Toward maintenance of hypercores in large-scale dynamic hypergraphs
|
Luo, Qi
|
|
|
|
3 |
p. 647-664
|
artikel
|
| 164 |
Towards zero-overhead static and adaptive indexing in Hadoop
|
Richter, Stefan
|
|
2013
|
|
3 |
p. 469-494
|
artikel
|
| 165 |
UV-diagram: a voronoi diagram for uncertain spatial databases
|
Xie, Xike
|
|
2012
|
|
3 |
p. 319-344
|
artikel
|
| 166 |
Views in a large-scale XML repository
|
Aguilera, Vincent
|
|
2002
|
|
3 |
p. 238-255
|
artikel
|
| 167 |
Z-SKY: an efficient skyline query processing framework based on Z-order
|
Lee, Ken C. K.
|
|
2009
|
|
3 |
p. 333-362
|
artikel
|
Tijdschrift beschrijving