Querying priced information in databases: the conjunctive case (2007)
Carmo, Renato; Feder, Tomás; Kohayakawa, Yoshiharu 
; Laber, Eduardo Sany; Motwani, Rajeev; O'Callaghan, Liadan; Panigrahy, Rina; Thomas, Dilys
Fonte: ACM Transactions on Algorithms (TALG). Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARMO, Renato et al. Querying priced information in databases: the conjunctive case. ACM Transactions on Algorithms (TALG), v. 3, n. 1, p. 1-22, 2007Tradução . . Disponível em: https://doi.org/10.1145/1186810.1186819. Acesso em: 13 set. 2024.APA
Carmo, R., Feder, T., Kohayakawa, Y., Laber, E. S., Motwani, R., O'Callaghan, L., et al. (2007). Querying priced information in databases: the conjunctive case. ACM Transactions on Algorithms (TALG), 3( 1), 1-22. doi:10.1145/1186810.1186819NLM
Carmo R, Feder T, Kohayakawa Y, Laber ES, Motwani R, O'Callaghan L, Panigrahy R, Thomas D. Querying priced information in databases: the conjunctive case [Internet]. ACM Transactions on Algorithms (TALG). 2007 ; 3( 1): 1-22.[citado 2024 set. 13 ] Available from: https://doi.org/10.1145/1186810.1186819Vancouver
Carmo R, Feder T, Kohayakawa Y, Laber ES, Motwani R, O'Callaghan L, Panigrahy R, Thomas D. Querying priced information in databases: the conjunctive case [Internet]. ACM Transactions on Algorithms (TALG). 2007 ; 3( 1): 1-22.[citado 2024 set. 13 ] Available from: https://doi.org/10.1145/1186810.1186819
