Inproceedings,
Querying connected tuple trees for relational keyword search.
M. Thein.CAMP, page 285-289. IEEE, (2012)
Meta data
- BibTeX key
- conf/infrkm/Thein12
- entry type
- inproceedings
- booktitle
- CAMP
- year
- 2012
- pages
- 285-289
- publisher
- IEEE
- crossref
- conf/infrkm/2012
- ee
- https://doi.org/10.1109/InfRKM.2012.6204992
- isbn
- 978-1-4673-1091-8
- url
- http://dblp.uni-trier.de/db/conf/infrkm/infrkm2012.html#Thein12
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/infrkm/Thein12
%A Thein, Myint Myint
%B CAMP
%D 2012
%E Mahmod, Ramlan
%E Abdullah, Rusli
%E Abdullah, Lili Nurliyana
%E Sembok, Tengku Mohd Tengku
%E Smeaton, Alan F.
%E Crestani, Fabio
%E Doraisamy, Shyamala
%E Kadir, Rabiah Abdul
%E Ismail, Mahamod
%I IEEE
%K dblp
%P 285-289
%T Querying connected tuple trees for relational keyword search.
%U http://dblp.uni-trier.de/db/conf/infrkm/infrkm2012.html#Thein12
%@ 978-1-4673-1091-8
@inproceedings{conf/infrkm/Thein12,
added-at = {2017-05-25T00:00:00.000+0200},
author = {Thein, Myint Myint},
biburl = {https://www.bibsonomy.org/bibtex/2200a1eb490ba8041d62a700234a1ae4f/dblp},
booktitle = {CAMP},
crossref = {conf/infrkm/2012},
editor = {Mahmod, Ramlan and Abdullah, Rusli and Abdullah, Lili Nurliyana and Sembok, Tengku Mohd Tengku and Smeaton, Alan F. and Crestani, Fabio and Doraisamy, Shyamala and Kadir, Rabiah Abdul and Ismail, Mahamod},
ee = {https://doi.org/10.1109/InfRKM.2012.6204992},
interhash = {6fdbd5c42039c5112083396153b58a56},
intrahash = {200a1eb490ba8041d62a700234a1ae4f},
isbn = {978-1-4673-1091-8},
keywords = {dblp},
pages = {285-289},
publisher = {IEEE},
timestamp = {2020-10-29T11:34:54.000+0100},
title = {Querying connected tuple trees for relational keyword search.},
url = {http://dblp.uni-trier.de/db/conf/infrkm/infrkm2012.html#Thein12},
year = 2012
}