Filters








15 Hits in 6.7 sec

Database researchers

Gerhard Weikum
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
databases of the traditional kind.  ...  DB researchers have traditionally focused on engine-centered issues such as indexing, query processing, and transactions.  ...  In the meantime, steady incremental progress is better than not embarking on these important problems at all. EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951368 dblp:conf/edbt/Weikum11 fatcat:bkokyg2fsna7rb3kkb3jc23oqm

Big data and cloud computing

Divyakant Agrawal, Sudipto Das, Amr El Abbadi
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
We then focus on providing an in-depth analysis of systems for supporting update intensive web-applications and provide a survey of the state-of-theart in this domain.  ...  Scalable database management systems (DBMS)-both for update intensive application workloads as well as decision support systems for descriptive and deep analytics-are a critical part of the cloud infrastructure  ...  BIOGRAPHICAL SKETCHES EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951432 dblp:conf/edbt/AgrawalDA11 fatcat:q3rhtmgrvjhyrlrw3qpxfwa6da

Synopses for probabilistic data over large domains

Nicholas D. Larusso, Ambuj Singh
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
Recent research in the area of probabilistic databases has mainly focused on managing and querying discrete data in which the domain is limited to a small number of values (i.e. on the order of 10).  ...  Such methods are not capable of extending their use to continuous-valued attributes.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. EDBT 2011, March 22-24, 2011 , Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951412 dblp:conf/edbt/LarussoS11 fatcat:jfksu5t2yrbitpglyhfnv43zwq

Mining closed discriminative dyadic sequential patterns

David Lo, Hong Cheng, Lucia
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
Our goal is to mine a set of closed discriminative dyadic sequential patterns from a database of sequence pairs each belonging to one of the two classes +ve and -ve.  ...  We provide a solution of this new problem by proposing new search space traversal strategy, projected database structure, pruning properties, and novel mining algorithms.  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951371 dblp:conf/edbt/LoCL11 fatcat:qglmw5pd3zggvbnfyrax377b3u

On enhancing scalability for distributed RDF/S stores

George Tsatsanifos, Dimitris Sacharidis, Timos Sellis
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
This work presents MIDAS-RDF, a distributed P2P RDF/S repository that is built on top of a distributed multi-dimensional index structure.  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ...  On the other hand, our approach does not require from each peer to maintain multiple RDF databases for distinct purposes.  ... 
doi:10.1145/1951365.1951384 dblp:conf/edbt/TsatsanifosSS11 fatcat:nuhgdo54pbgxrnllxlsd4mxiuu

Fast random graph generation

Sadegh Nobari, Xuesong Lu, Panagiotis Karras, Stéphane Bressan
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
Today, several database applications call for the generation of random graphs. A fundamental, versatile random graph model adopted for that purpose is the Erdős-Rényi Γv,p model.  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ...  It suffices to initialize the pseudo-random generator with different seed on each stream [24] , using a single master seed from which individual thread seeds are derived.  ... 
doi:10.1145/1951365.1951406 dblp:conf/edbt/NobariLKB11 fatcat:hsmrsslmlzcqnptt64hlg2s4dm

Symmetrizations for clustering directed graphs

Venu Satuluri, Srinivasan Parthasarathy
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
This paper investigates various ways of symmetrizing a directed graph into an undirected graph so that previous work on clustering undirected graphs may subsequently be leveraged.  ...  Recent work on clustering directed graphs has looked at generalizing objective functions such as conductance to directed graphs and minimizing such objective functions using spectral methods.We show that  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951407 dblp:conf/edbt/SatuluriP11 fatcat:cifs6knvarckpgiwqpyozfnzii

Link-based hidden attribute discovery for objects on Web

Jiuming Huang, Haixun Wang, Yan Jia, Ariel Fuxman
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
Using the unsupervised method in our approach, we are able to discover hidden attributes not explicitly shown on object Web pages. We test our approach on two online shopping Websites.  ...  However, much attribute information about an object is hidden in the dynamic user interaction and is not on the Web page that describes the object.  ...  EDBT 2011, March 22-24, 2011, Uppsala, Sweden. Copyright 2011 ACM 978-1-4503-0528-0/11/0003 ...$10.00. Figure 1 . 1 Product page.  ... 
doi:10.1145/1951365.1951421 dblp:conf/edbt/HuangWJF11 fatcat:bs7xrswwp5dapam7uidzye5di4

Efficient discovery of frequent subgraph patterns in uncertain graph databases

Odysseas Papapetrou, Ekaterini Ioannou, Dimitrios Skoutas
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
The evaluation of our approach on three real-world datasets as well as on synthetic uncertain graph databases demonstrates the significant cost savings with respect to the state-of-the-art approach.  ...  The proposed algorithm relies on the apriori property for enumerating candidate subgraph patterns efficiently.  ...  The second aims at extending UGRAP to use the index for finding only the maximal or closed frequent subgraphs in the uncertain graph database. EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951408 dblp:conf/edbt/PapapetrouIS11 fatcat:k3stjtaohfatfdnbls6ln7dvua

GPX-matcher

Mohammad Sadoghi, Ioana Burcea, Hans-Arno Jacobsen
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ...  INTRODUCTION XML has become the lingua franca on the Internet, with applications ranging from life sciences [24] to news [22] and advertisement dissemination, among many others.  ... 
doi:10.1145/1951365.1951374 dblp:conf/edbt/SadoghiBJ11 fatcat:a5hemruetrczlas2an7o7hp234

Efficient answering of set containment queries for skewed item distributions

Manolis Terrovitis, Panagiotis Bouros, Panos Vassiliadis, Timos Sellis, Nikos Mamoulis
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
OIF is simple to implement and our experiments on both real and synthetic data show that it greatly outperforms the current state-of-the-art methods for all three classes of containment queries.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. EDBT 2011, March 22-24, 2011 , Uppsala, Sweden.  ...  Research in set containment query evaluation in a database context has been limited [18, 21] .  ... 
doi:10.1145/1951365.1951394 dblp:conf/edbt/TerrovitisBVSM11 fatcat:tu7w3jyqpzalpdsibiskhes5yq

Constructing concept relation network and its application to personalized web search

Kenneth Wai-Ting Leung, Hing Yuet Fung, Dik Lun Lee
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
., Google) on the web. Taking advantage of large scale commercial search engines, CRN is able to derive a large number of highly coherent, highly related concepts.  ...  We also propose to extract concept clusters from CRN based on different graph topology. We observe that complete subgraphs in CRN can be used to effectively determine semantically related concepts.  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden. Copyright 2011 ACM 978-1-4503-0528-0/11/0003 ...$10.00 Figure 1 : 1 A sample branch showing c 2 , c 3 and c 4 as the child nodes of c 1 .  ... 
doi:10.1145/1951365.1951415 dblp:conf/edbt/LeungFL11 fatcat:judaep6crffvnn3deuyup6msdy

Fast and accurate computation of equi-depth histograms over data streams

Hamid Mousavi, Carlo Zaniolo
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
query answering, distribution fitting, and parallel database partitioning.  ...  The experimental results also indicate that BASH is more stable on data affected by frequent concept shifts.  ...  ACKNOWLEDGMENTS EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden. Copyright 2011 ACM 978-1-4503-0528-0/11/0003 ...$10.00 Figure 1 : 1 Incrementing an EH sketch twice at time 58 and 60.  ... 
doi:10.1145/1951365.1951376 dblp:conf/edbt/MousaviZ11 fatcat:qwlwglnrsvfnhkyz3rb26k2rwq

Dynamic reasoning on XML updates

Federico Cavalieri, Giovanna Guerrini, Marco Mesiti
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
This requires some capabilities of dynamic reasoning on updates.  ...  The PUL executor needs to manage several PULs, that, depending on the application context, are to be executed as sequential or parallel update requests, possibly relying on application-specific policies  ...  EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ... 
doi:10.1145/1951365.1951387 dblp:conf/edbt/CavalieriGM11 fatcat:o5fwb3xtpfh2nfy6y27kyqgfhi

Data integration with dependent sources

Anish Das Sarma, Xin Luna Dong, Alon Halevy
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
These are the (1) cost-minimization problem: what is the minimum cost we must incur to get all answer tuples, (2) maximum-coverage problem: given a bound on the cost, how can we get the maximum possible  ...  Thus, we have A(Π) = l X j=1 0 @ c j · j X i=1 Incr(i) 1 A ≥ C X j=1 j· S C > C 2 · S ≥ A(Πopt) 2 EDBT 2011 , 2011 March 22-24, 2011, Uppsala, Sweden.  ...  In general, a copier may copy data by performing a query over another source and adding the result of that query to its database; in practice, however, one may not know the queries used to copy data and  ... 
doi:10.1145/1951365.1951414 dblp:conf/edbt/SarmaDH11 fatcat:cpxnussthva7rgircmmvc47awq