ACM transactions on database systems

• 

  Año 2011, Vol. 36, Número 4

  • Finding maximal cliques in massive networks

    James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu

    • Resumen

    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

    • Resumen

    pág. 22

    

  • Characterizing schema mappings via data examples

    Bogdan Alexe, Balder Ten Cate, Phokion G. Kolaitis, Wang-Chiew Tan

    • Resumen

    pág. 23

    

  • Bag equivalence of tree patterns

    Sara Cohen, Yaacov Y. Weiss

    • Resumen

    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

    • Resumen

    pág. 25

    

  • Collaborative personalized top-k processing

    Xiao-Xi Bai, Rachid Guerraoui, Anne-Marie Kermarrec, Vincent Leroy

    • Resumen

    pág. 26

    

  • The data cyclotron query processing scheme

    Romulo Goncalves, Martin L. Kersten

    • Resumen

    pág. 27