@article{Abiteboul/etal:97a,
	title = {The \{{Lorel}\} query language for semistructured data},
	volume = {1},
	abstract = {We present the Lorel language, designed for querying
semistructured data. Semistructured data is becoming
more and more prevalent, e.g., in structured documents
such as HTML and when performing simple integration of
data from multiple sources. Traditional data models and
query languages are inappropriate, since semistructured
data often is irregular: some data is missing, similar
concepts are represented using different types,
heterogeneous sets are present, or object structure is
not fully known. Lorel is a user-friendly language in
the SQL/OQL style for querying such data effectively.
For wide applicability, the simple object model
underlying Lorel can be viewed as an extension of the
ODMG data model and the Lorel language as an extension
of OQL. The main novelties of the Lorel language are:
(i) the extensive use of coercion to relieve the user
from the strict typing of OQL, which is inappropriate
for semistructured data; and (ii) powerful path
expressions, which permit a flexible form of
declarative navigational access and are particularly
suitable when the details of the structure are not
known to the user. Lorel also includes a declarative
update language. Lorel is implemented as the query
language of the Lore prototype database management
system at Stanford. Information about Lore can be found
at http://www-db.stanford.edu/lore. In addition to
presenting the Lorel language in full, this paper
briefly describes the Lore system and query processor.
We also briefly discuss a second implementation of
Lorel on top of a conventional object-oriented database
management system, the O2 system.},
	journal = {International Journal on Digital Libraries},
	author = {Abiteboul, S and Quass, D and McHugh, J and Widom, J and Wiener, J L},
	year = {1997},
	note = {Publisher: Springer
Series Number: 1
Place: Heidelberg et al.},
	pages = {68--88},
}

{"_id":{"_str":"53ff72c17c90ec6e13000eb5"},"__v":0,"authorIDs":[],"author_short":["Abiteboul, S","Quass, D","McHugh, J","Widom, J","Wiener, J L"],"bibbaseid":"abiteboul-quass-mchugh-widom-wiener-thelorelquerylanguageforsemistructureddata-1997","bibdata":{"bibtype":"article","type":"article","title":"The \\Lorel\\ query language for semistructured data","volume":"1","abstract":"We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages are inappropriate, since semistructured data often is irregular: some data is missing, similar concepts are represented using different types, heterogeneous sets are present, or object structure is not fully known. Lorel is a user-friendly language in the SQL/OQL style for querying such data effectively. For wide applicability, the simple object model underlying Lorel can be viewed as an extension of the ODMG data model and the Lorel language as an extension of OQL. The main novelties of the Lorel language are: (i) the extensive use of coercion to relieve the user from the strict typing of OQL, which is inappropriate for semistructured data; and (ii) powerful path expressions, which permit a flexible form of declarative navigational access and are particularly suitable when the details of the structure are not known to the user. Lorel also includes a declarative update language. Lorel is implemented as the query language of the Lore prototype database management system at Stanford. Information about Lore can be found at http://www-db.stanford.edu/lore. In addition to presenting the Lorel language in full, this paper briefly describes the Lore system and query processor. We also briefly discuss a second implementation of Lorel on top of a conventional object-oriented database management system, the O2 system.","journal":"International Journal on Digital Libraries","author":[{"propositions":[],"lastnames":["Abiteboul"],"firstnames":["S"],"suffixes":[]},{"propositions":[],"lastnames":["Quass"],"firstnames":["D"],"suffixes":[]},{"propositions":[],"lastnames":["McHugh"],"firstnames":["J"],"suffixes":[]},{"propositions":[],"lastnames":["Widom"],"firstnames":["J"],"suffixes":[]},{"propositions":[],"lastnames":["Wiener"],"firstnames":["J","L"],"suffixes":[]}],"year":"1997","note":"Publisher: Springer Series Number: 1 Place: Heidelberg et al.","pages":"68–88","bibtex":"@article{Abiteboul/etal:97a,\n\ttitle = {The \\{{Lorel}\\} query language for semistructured data},\n\tvolume = {1},\n\tabstract = {We present the Lorel language, designed for querying\nsemistructured data. Semistructured data is becoming\nmore and more prevalent, e.g., in structured documents\nsuch as HTML and when performing simple integration of\ndata from multiple sources. Traditional data models and\nquery languages are inappropriate, since semistructured\ndata often is irregular: some data is missing, similar\nconcepts are represented using different types,\nheterogeneous sets are present, or object structure is\nnot fully known. Lorel is a user-friendly language in\nthe SQL/OQL style for querying such data effectively.\nFor wide applicability, the simple object model\nunderlying Lorel can be viewed as an extension of the\nODMG data model and the Lorel language as an extension\nof OQL. The main novelties of the Lorel language are:\n(i) the extensive use of coercion to relieve the user\nfrom the strict typing of OQL, which is inappropriate\nfor semistructured data; and (ii) powerful path\nexpressions, which permit a flexible form of\ndeclarative navigational access and are particularly\nsuitable when the details of the structure are not\nknown to the user. Lorel also includes a declarative\nupdate language. Lorel is implemented as the query\nlanguage of the Lore prototype database management\nsystem at Stanford. Information about Lore can be found\nat http://www-db.stanford.edu/lore. In addition to\npresenting the Lorel language in full, this paper\nbriefly describes the Lore system and query processor.\nWe also briefly discuss a second implementation of\nLorel on top of a conventional object-oriented database\nmanagement system, the O2 system.},\n\tjournal = {International Journal on Digital Libraries},\n\tauthor = {Abiteboul, S and Quass, D and McHugh, J and Widom, J and Wiener, J L},\n\tyear = {1997},\n\tnote = {Publisher: Springer\nSeries Number: 1\nPlace: Heidelberg et al.},\n\tpages = {68--88},\n}\n\n","author_short":["Abiteboul, S","Quass, D","McHugh, J","Widom, J","Wiener, J L"],"key":"Abiteboul/etal:97a","id":"Abiteboul/etal:97a","bibbaseid":"abiteboul-quass-mchugh-widom-wiener-thelorelquerylanguageforsemistructureddata-1997","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/ifromm","creationDate":"2014-08-28T18:19:45.179Z","downloads":0,"keywords":[],"search_terms":["lorel","query","language","semistructured","data","abiteboul","quass","mchugh","widom","wiener"],"title":"The \\Lorel\\ query language for semistructured data","year":1997,"dataSources":["mL7NKvaepNEWFcMvG","N4kJAiLiJ7kxfNsoh"]}