BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Mohammad Sadoghi, Hans-Arno Jacobsen
BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space
SIGMOD, 2011.

SIGMOD 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SIGMOD-2011-SadoghiJ,
	author        = "Mohammad Sadoghi and Hans-Arno Jacobsen",
	booktitle     = "{Proceedings of the 29th ACM SIGMOD International Conference on Management of Data}",
	doi           = "10.1145/1989323.1989390",
	isbn          = "978-1-4503-0661-4",
	pages         = "637--648",
	publisher     = "{ACM}",
	title         = "{BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space}",
	year          = 2011,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.