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
 
                             181 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A configurable type hierarchy index for OODB Mueck, Thomas A.
1997
4 p. 312-332
artikel
2 A cost model for random access queries in document stores Hewasinghage, Moditha

4 p. 559-578
artikel
3 Adaptive website recommendations with AWESOME Thor, Andreas
2005
4 p. 357-372
artikel
4 A data mining proxy approach for efficient frequent itemset mining Yu, Jeffrey Xu
2007
4 p. 947-970
artikel
5 A distributed spatial index for error-prone wireless data broadcast Zheng, Baihua
2009
4 p. 959-986
artikel
6 A framework for efficient multi-attribute movement data analysis Valdés, Fabio
2018
4 p. 427-449
artikel
7 A general framework to resolve the MisMatch problem in XML keyword search Bao, Zhifeng
2015
4 p. 493-518
artikel
8 A generic framework for efficient computation of top-k diverse results Islam, Md Mouinul

4 p. 737-761
artikel
9 A graph-theoretic model for optimizing queries involving methods Lee, Chiang
2001
4 p. 327-343
artikel
10 A highly optimized algorithm for continuous intersection join queries over moving objects Zhang, Rui
2011
4 p. 561-586
artikel
11 A holistic and principled approach for the empty-answer problem Mottin, Davide
2016
4 p. 597-622
artikel
12 Algebraic manipulation of scientific datasets Howe, Bill
2005
4 p. 397-416
artikel
13 A meta-level analysis of online anomaly detectors Ntroumpogiannis, Antonios

4 p. 845-886
artikel
14 An annotation management system for relational databases Bhagwat, Deepavali
2005
4 p. 373-396
artikel
15 An asymptotically optimal multiversion B-tree Becker, Bruno
1996
4 p. 264-275
artikel
16 Anatomy of a native XML base management system Fiebig, T.
2002
4 p. 292-314
artikel
17 A new intrusion detection system using support vector machines and hierarchical clustering Khan, Latifur
2006
4 p. 507-521
artikel
18 Anonymity meets game theory: secure data integration with malicious participants Mohammed, Noman
2010
4 p. 567-588
artikel
19 Anonymity preserving pattern discovery Atzori, Maurizio
2006
4 p. 703-727
artikel
20 Answering queries using views: A survey Halevy, Alon Y.
2001
4 p. 270-294
artikel
21 An XML query engine for network-bound data Ives, Zachary G.
2002
4 p. 380-402
artikel
22 Approximate similarity retrieval with M-trees Zezula, Pavel
1998
4 p. 275-293
artikel
23 A privacy-preserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms Mukherjee, Shibnath
2006
4 p. 293-315
artikel
24 Argument discovery via crowdsourcing Nguyen, Quoc Viet Hung
2017
4 p. 511-535
artikel
25 A secure distributed framework for achieving k-anonymity Jiang, Wei
2006
4 p. 316-333
artikel
26 A survey of approaches to automatic schema matching Rahm, Erhard
2001
4 p. 334-350
artikel
27 A survey on deep learning approaches for text-to-SQL Katsogiannis-Meimarakis, George

4 p. 905-936
artikel
28 A survey on semantic schema discovery Kellou-Menouer, Kenza

4 p. 675-710
artikel
29 Balancing energy efficiency and quality of aggregate data in sensor networks Sharaf, Mohamed A.
2004
4 p. 384-403
artikel
30 Building knowledge base management systems Mylopoulos, John
1996
4 p. 238-263
artikel
31 Cleaning data with Llunatic Geerts, Floris

4 p. 867-892
artikel
32 Combining multi-visual features for efficient indexing in a large image database Ngu, Anne H.H.
2001
4 p. 279-293
artikel
33 Compact representations of temporal databases Bronselaer, Antoon
2018
4 p. 473-496
artikel
34 Complex RFID event processing Wang, Fusheng
2009
4 p. 913-931
artikel
35 Composing Web services on the Semantic Web Medjahed, Brahim
2003
4 p. 333-351
artikel
36 Correlated network data publication via differential privacy Chen, Rui
2013
4 p. 653-676
artikel
37 Data collection and quality challenges in deep learning: a data-centric AI perspective Whang, Steven Euijong

4 p. 791-813
artikel
38 DAWN: an efficient framework of DCT for data with error estimation Hsieh, Ming-Jyh
2006
4 p. 683-702
artikel
39 Delivering presentations from multimedia servers Balkir, Nevzat Hurkan
1998
4 p. 294-307
artikel
40 Dissemination of compressed historical information in sensor networks Deligiannakis, Antonios
2006
4 p. 439-461
artikel
41 Distilling relations using knowledge bases Hao, Shuang
2018
4 p. 497-519
artikel
42 Distributed detection of sequential anomalies in univariate time series Schneider, Johannes

4 p. 579-602
artikel
43 Dynamic constraints for record matching Fan, Wenfei
2010
4 p. 495-520
artikel
44 Effective and complete discovery of bidirectional order dependencies via set-based axioms Szlichta, Jaroslaw
2018
4 p. 573-591
artikel
45 Efficient algorithms for incremental Web log mining with dynamic thresholds Ou, Jian-Chih
2007
4 p. 827-845
artikel
46 Efficient and effective ER with progressive blocking Galhotra, Sainyam

4 p. 537-557
artikel
47 Efficient and effective similarity search over probabilistic data based on Earth Mover’s Distance Xu, Jia
2011
4 p. 535-559
artikel
48 Efficient exploratory clustering analyses in large-scale exploration processes Fritz, Manuel

4 p. 711-732
artikel
49 Efficient filtering of XML documents with XPath expressions Chan, C.-Y.
2002
4 p. 354-379
artikel
50 Efficient fuzzy full-text type-ahead search Li, Guoliang
2011
4 p. 617-640
artikel
51 Efficiently making (almost) any concurrency control mechanism serializable Wang, Tianzheng
2017
4 p. 537-562
artikel
52 Efficient multivariate data-oriented microaggregation Domingo-Ferrer, Josep
2006
4 p. 355-369
artikel
53 Efficient privacy-preserving similar document detection Murugesan, Mummoorthy
2009
4 p. 457-475
artikel
54 Efficient processing of moving collective spatial keyword queries Xu, Hongfei

4 p. 841-865
artikel
55 Efficient query autocompletion with edit distance-based error tolerance Qin, Jianbin

4 p. 919-943
artikel
56 Efficient query evaluation on probabilistic databases Dalvi, Nilesh
2006
4 p. 523-544
artikel
57 Efficient schemes for managing multiversionXML documents Chien, S.-Y.
2002
4 p. 332-353
artikel
58 Efficient set containment join Yang, Jianye
2018
4 p. 471-495
artikel
59 Efficient subsequence matching over large video databases Zhou, Xiangmin
2011
4 p. 489-508
artikel
60 Elite: an elastic infrastructure for big spatiotemporal trajectories Xie, Xike
2016
4 p. 473-493
artikel
61 Embedding-based subsequence matching with gaps–range–tolerances: a Query-By-Humming application Kotsifakos, Alexios
2015
4 p. 519-536
artikel
62 Ensuring location diversity in privacy-preserving spatio-temporal data publishing Cicek, A. Ercument
2013
4 p. 609-625
artikel
63 EXACT: an extensible approach to active object-oriented databases Díaz, Oscar
1997
4 p. 282-295
artikel
64 Extending DBMSs with satellite databases Plattner, Christian
2006
4 p. 657-682
artikel
65 Extending the power of datalog recursion Mazuran, Mirjana
2012
4 p. 471-493
artikel
66 External sorting on flash storage: reducing cell wearing and increasing efficiency by avoiding intermediate writes Kanza, Yaron
2016
4 p. 495-518
artikel
67 Fast and scalable method for distributed Boolean tensor factorization Park, Namyong
2019
4 p. 549-574
artikel
68 Fast diversified coherent core search on multi-layer graphs Zhu, Rong
2019
4 p. 597-622
artikel
69 Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces Amagata, Daichi

4 p. 797-821
artikel
70 Fast graph query processing with a low-cost index Cheng, James
2010
4 p. 521-539
artikel
71 Fast stochastic routing under time-varying uncertainty Pedersen, Simon Aagaard

4 p. 819-839
artikel
72 Finding hot query patterns over an XQuery stream Yang, Liang Huai
2004
4 p. 318-332
artikel
73 Finding $$k$$k most favorite products based on reverse top-$$t$$t queries Koh, Jia-Ling
2013
4 p. 541-564
artikel
74 Finding the optimal location and keywords in obstructed and unobstructed space Choudhury, Farhana Murtaza
2018
4 p. 445-470
artikel
75 Finding top-k relevant groups of spatial web objects Skovsgaard, Anders
2015
4 p. 537-555
artikel
76 Free riding-aware forwarding in Content-Addressable Networks Böhm, Klemens
2006
4 p. 463-482
artikel
77 Genericity in Java: persistent and database systems implications Alagić, Suad
2007
4 p. 847-878
artikel
78 Global transaction support for workflow management systems: from formal specification to practical implementation Grefen, Paul
2001
4 p. 316-333
artikel
79 GRAIL: a scalable index for reachability queries in very large graphs Yıldırım, Hilmi
2011
4 p. 509-534
artikel
80 gStore: a graph-based SPARQL query engine Zou, Lei
2013
4 p. 565-590
artikel
81 Guest Editorial Halevy, Alon Y.
2002
4 p. 273
artikel
82 Guest editorial Atluri, Vijay
2003
4 p. 285
artikel
83 Guest editorial: special issue on privacy preserving data management Ferrari, Elena
2006
4 p. 291-292
artikel
84 Guest Editorial to the special issue on data stream processing Gehrke, Johannes
2004
4 p. 317
artikel
85 Hierarchical clustering for OLAP: the CUBE File approach Karayannidis, Nikos
2006
4 p. 621-655
artikel
86 Hierarchical hippocratic databases with minimal disclosure for virtual organizations Massacci, Fabio
2006
4 p. 370-387
artikel
87 High availability, elasticity, and strong consistency for massively parallel scans over relational data Unterbrunner, Philipp
2013
4 p. 627-652
artikel
88 HMAP– A temporal data model managing intervals with different granularities and indeterminacy from natural language sentences Combi, Carlo
2001
4 p. 294-311
artikel
89 Indexing metric uncertain data for range queries and range joins Chen, Lu
2017
4 p. 585-610
artikel
90 Indexing very high-dimensional sparse and quasi-sparse vectors for similarity searches Wang, Changzhou
2001
4 p. 344-361
artikel
91 In-Memory Interval Joins Bouros, Panagiotis

4 p. 667-691
artikel
92 Instance-level worst-case query bounds on R-trees Tao, Yufei
2013
4 p. 591-607
artikel
93 Integrating symbolic images into a multimedia database system using classification and abstraction approaches Soffer, Aya
1998
4 p. 253-274
artikel
94 Interaction-aware scheduling of report-generation workloads Ahmad, Mumtaz
2011
4 p. 589-615
artikel
95 Interactively discovering and ranking desired tuples by data exploration Qin, Xuedi

4 p. 753-777
artikel
96 Interleaving with coroutines: a systematic and practical approach to hide memory latency in index joins Psaropoulos, Georgios
2018
4 p. 451-471
artikel
97 Introduction Özsu, M. Tamer
1998
4 p. 205
artikel
98 I/O-efficient algorithms for top-k nearest keyword search in massive graphs Zhu, Qiankun
2017
4 p. 563-583
artikel
99 Know your customer: computing k-most promising products for targeted marketing Islam, Md. Saiful
2016
4 p. 545-570
artikel
100 Large-scale indexing of spatial data in distributed repositories: the SD-Rtree du Mouza, Cédric
2009
4 p. 933-958
artikel
101 Learning to match ontologies on the Semantic Web Doan, AnHai
2003
4 p. 303-319
artikel
102 Location- and keyword-based querying of geo-textual data: a survey Chen, Zhida

4 p. 603-640
artikel
103 Managing multiple and distributed ontologies on the Semantic Web Maedche, A.
2003
4 p. 286-302
artikel
104 Micro-architectural analysis of in-memory OLTP: Revisited Sirin, Utku

4 p. 641-665
artikel
105 Mining billion-scale tensors: algorithms and discoveries Jeon, Inah
2016
4 p. 519-544
artikel
106 Mis-categorized entities detection Hao, Shuang

4 p. 515-536
artikel
107 Model averaging in distributed machine learning: a case study with Apache Spark Guo, Yunyan

4 p. 693-712
artikel
108 Model-based approximate querying in sensor networks Deshpande, Amol
2005
4 p. 417-443
artikel
109 Modeling the execution semantics of stream processing engines with SECRET Dindar, Nihal
2012
4 p. 421-446
artikel
110 Monotonic complements for independent data warehouses Laurent, D.
2001
4 p. 295-315
artikel
111 Multi-schema-version data management: data independence in the twenty-first century Herrmann, Kai
2018
4 p. 547-571
artikel
112 On efficiently finding reverse k-nearest neighbors over uncertain graphs Gao, Yunjun
2017
4 p. 467-492
artikel
113 On periodic resource scheduling for continuous-media databases Garofalakis, Minos N.
1998
4 p. 206-225
artikel
114 Operator scheduling in data stream systems Babcock, Brian
2004
4 p. 333-353
artikel
115 Optimal clip ordering for multi-clip queries Ng, Raymond T.
1998
4 p. 239-252
artikel
116 Optimal price profile for influential nodes in online social networks Zhu, Yuqing

4 p. 779-795
artikel
117 Outsourcing shortest distance computing with privacy protection Gao, Jun
2013
4 p. 543-559
artikel
118 Parallel mining of large maximal quasi-cliques Khalil, Jalal

4 p. 649-674
artikel
119 Parametric schema inference for massive JSON datasets Baazizi, Mohamed-Amine
2019
4 p. 497-521
artikel
120 Partitioning functions for stateful data parallelism in stream processing Gedik, Buğra
2013
4 p. 517-539
artikel
121 Path prediction and predictive range querying in road network databases Jeung, Hoyoung
2010
4 p. 585-602
artikel
122 P2CG: a privacy preserving collaborative graph neural network training framework Miao, Xupeng

4 p. 717-736
artikel
123 Performance analysis of a dual-tree algorithm for computing spatial distance histograms Chen, Shaoping
2010
4 p. 471-494
artikel
124 POESIA: An ontological workflow approach for composing Web services in agriculture Fileto, Renato
2003
4 p. 352-367
artikel
125 Possible and certain keys for SQL Köhler, Henning
2016
4 p. 571-596
artikel
126 Prescriptive analytics: a survey of emerging trends and technologies Frazzetto, Davide
2019
4 p. 575-595
artikel
127 Privacy in geo-social networks: proximity notification with untrusted service providers and curious buddies Mascetti, Sergio
2010
4 p. 541-566
artikel
128 Privacy leakage in multi-relational databases: a semi-supervised learning perspective Xiong, Hui
2006
4 p. 388-402
artikel
129 Privacy-preserving indexing of documents on the network Bawa, Mayank
2009
4 p. 837-856
artikel
130 Privacy-preserving Naïve Bayes classification Vaidya, Jaideep
2007
4 p. 879-898
artikel
131 Privacy-preserving worker allocation in crowdsourcing Zheng, Libin

4 p. 733-751
artikel
132 Profiling relational data: a survey Abedjan, Ziawasch
2015
4 p. 557-581
artikel
133 ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees Echihabi, Karima

4 p. 763-789
artikel
134 Provenance-based analysis of data-centric processes Deutch, Daniel
2015
4 p. 583-607
artikel
135 Providing k-anonymity in data mining Friedman, Arik
2007
4 p. 789-804
artikel
136 Purpose based access control for privacy protection in relational database systems Byun, Ji-Won
2006
4 p. 603-619
artikel
137 QoS-aware optimization of sensor network queries Galpin, Ixent
2012
4 p. 495-517
artikel
138 Quantiles over data streams: experimental comparisons, new analyses, and further improvements Luo, Ge
2016
4 p. 449-472
artikel
139 Query processing and optimization in Oracle Rdb Antoshenkov, Gennady
1996
4 p. 229-237
artikel
140 Query processing over object views of relational data Fahl, Gustav
1997
4 p. 261-281
artikel
141 Query translation from XPath to SQL in the presence of recursive DTDs Fan, Wenfei
2009
4 p. 857-883
artikel
142 RATEWeb: Reputation Assessment for Trust Establishment among Web services Malik, Zaki
2009
4 p. 885-911
artikel
143 Recommending XML physical designs for XML databases Elghandour, Iman
2012
4 p. 447-470
artikel
144 Retrospective on Aurora Balakrishnan, Hari
2004
4 p. 370-383
artikel
145 Rights protection of trajectory datasets with nearest-neighbor preservation Lucchese, Claudio
2010
4 p. 531-556
artikel
146 Robust and scalable content-and-structure indexing Wellenzohn, Kevin

4 p. 689-715
artikel
147 Scalable computational geometry in MapReduce Li, Yuan
2019
4 p. 523-548
artikel
148 Scaling and time warping in time series querying Fu, Ada Wai-Chee
2007
4 p. 899-921
artikel
149 Semantic and schematic similarities between database objects:a context-based approach Kashyap, Vipul
1996
4 p. 276-304
artikel
150 Semantic integrity support in SQL:1999 and commercial (object-)relational database management systems Türker, Can
2001
4 p. 241-269
artikel
151 Smooth Scan: robust access path selection without cardinality estimation Borovica-Gajic, Renata
2018
4 p. 521-545
artikel
152 Span-reachability querying in large temporal graphs Wen, Dong

4 p. 629-647
artikel
153 Spatial and temporal content-based access to hypervideo databases Jiang, Haitao
1998
4 p. 226-238
artikel
154 Special issue: Best papers of VLDB 2004 Özsu, M. Tamer
2005
4 p. 355-356
artikel
155 SQUID: subtrajectory query in trillion-scale GPS database Zhang, Dongxiang

4 p. 887-904
artikel
156 Streaming multiple aggregations using phantoms Zhang, Rui
2010
4 p. 557-583
artikel
157 Stream sampling over windows with worst-case optimality and $$\ell $$ℓ-overlap independence Tao, Yufei
2017
4 p. 493-510
artikel
158 Structural consistency: enabling XML keyword search to eliminate spurious results consistently Lee, Ki-Hoon
2010
4 p. 503-529
artikel
159 Structured document storage and refined declarative and navigational access mechanisms in HyperStorM Böhm, Klemens
1997
4 p. 296-311
artikel
160 Succinct representation of flexible and privacy-preserving access rights Blanton, Marina
2006
4 p. 334-354
artikel
161 Super-EGO: fast multi-dimensional similarity join Kalashnikov, Dmitri V.
2013
4 p. 561-585
artikel
162 Supporting efficient multimedia database exploration Li, Wen-Syan
2001
4 p. 312-326
artikel
163 Supporting ranking queries on uncertain and incomplete data Soliman, Mohamed A.
2010
4 p. 477-501
artikel
164 Supporting the data cube lifecycle: the power of ROLAP Morfonios, Konstantinos
2006
4 p. 729-764
artikel
165 Task assignment optimization in knowledge-intensive crowdsourcing Basu Roy, Senjuti
2015
4 p. 467-491
artikel
166 The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient Traina, Caetano
2006
4 p. 483-505
artikel
167 The optimal sequenced route query Sharifzadeh, Mehdi
2006
4 p. 765-787
artikel
168 The partitioned exponential file for database storage management Jermaine, Christopher
2006
4 p. 417-437
artikel
169 THESUS: Organizing Web document collections based on link semantics Halkidi, Maria
2003
4 p. 320-332
artikel
170 TIMBER: A native XML database Jagadish, H.V.
2002
4 p. 274-291
artikel
171 Time-topology analysis on temporal graphs Lou, Yunkai

4 p. 815-843
artikel
172 Top-k queries over web applications Deutch, Daniel
2012
4 p. 519-542
artikel
173 Top-k relevant semantic place retrieval on spatiotemporal RDF data Wu, Dingming

4 p. 893-917
artikel
174 Tracking set-expression cardinalities over continuous update streams Ganguly, Sumit
2004
4 p. 354-369
artikel
175 Tree-based partition querying: a methodology for computing medoids in large spatial datasets Mouratidis, Kyriakos
2007
4 p. 923-945
artikel
176 Tree pattern query minimization Amer-Yahia, S.
2002
4 p. 315-331
artikel
177 Trie-join: a trie-based method for efficient string similarity joins Feng, Jianhua
2011
4 p. 437-461
artikel
178 Using extended feature objects for partial similarity retrieval Berchtold, Stefan
1997
4 p. 333-348
artikel
179 Value complete, column complete, predicate complete Härder, Theo
2007
4 p. 805-826
artikel
180 Visually aware recommendation with aesthetic features Yu, Wenhui

4 p. 495-513
artikel
181 Windowed pq-grams for approximate joins of data-centric XML Augsten, Nikolaus
2011
4 p. 463-488
artikel
                             181 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland