pág. 1
pág. 2
pág. 3
pág. 4
pág. 5
pág. 6
Path-tree: An efficient reachability indexing scheme for large directed graphs
pág. 7
pág. 8
pág. 9
pág. 10
Reverse data exchange: coping with nulls
Ronald Fagin, Phokion G. Kolaitis, Doina Popa-Liseanu, Wang-Chiew Tan
pág. 11
pág. 12
pág. 13
pág. 14
Efficient similarity joins for near-duplicate detection
Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu, Guoren Wang
pág. 15
Differential dependencies: reasoning and discovery
pág. 16
Embedding-based subsequence matching in time-series databases
Panagiotis Papapetrou, Vassilis Athitsos, Michalis Potamias, George Kollios, Dimitrios Gunopulos
pág. 17
The monte carlo database system: stochastic analysis close to the data
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Pérez, Christopher Jermaine, Peter J. Haas
pág. 18
pág. 19
Finding maximal cliques in massive networks
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu
pág. 21
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eric Sedlar, Anthony D. Nguyen, Tim Kaldewey, Victor W. Lee, Scott A. Brandt, Pradeep Dubey
pág. 22
Characterizing schema mappings via data examples
Bogdan Alexe, Balder Ten Cate, Phokion G. Kolaitis, Wang-Chiew Tan
pág. 23
pág. 24
Capturing continuous data and answering aggregate queries in probabilistic XML
Serge Abiteboul, T. H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart
pág. 25
Collaborative personalized top-k processing
Xiao-Xi Bai, Rachid Guerraoui, Anne-Marie Kermarrec, Vincent Leroy
pág. 26
pág. 27
© 2001-2024 Fundación Dialnet · Todos los derechos reservados