A personal perspective on keyword search over data graphs

Yehoshua Sagiv

doi:10.1145/2448496.2448500

A personal perspective on keyword search over data graphs

Yehoshua Sagiv^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Theoretical and practical issues pertaining to keyword search over data graphs are discussed. A formal model and algo rithms for enumerating answers (by operating directly on the data graph) are described. Various aspects of a system are explained, including the object-connector-property data model, how it is used to construct a data graph from an XML document, how to deal with redundancies in the source data, what are duplicate answers, implementation and GUI. An approach to ranking that combines textual relevance with semantic considerations is described. It is argued that search over data graphs is inherently a two-dimensional process, where the goal is not just to find particular content but also to collect information on how the desired data may be semantically connected.

Original language	English
Title of host publication	ICDT 2013 - 16th International Conference on Database Theory, Proceedings
Pages	21-32
Number of pages	12
DOIs	https://doi.org/10.1145/2448496.2448500
State	Published - 2013
Event	16th International Conference on Database Theory, ICDT 2013 - Genoa, Italy Duration: 18 Mar 2013 → 22 Mar 2013

Publication series

Name	ACM International Conference Proceeding Series

Conference

Conference	16th International Conference on Database Theory, ICDT 2013
Country/Territory	Italy
City	Genoa
Period	18/03/13 → 22/03/13

Keywords

Data graph
Enumeration algorithm
Graph search
Information retrieval
Search

Access to Document

10.1145/2448496.2448500

Cite this

@inproceedings{da2888b62c804e9485f0adceeeecf780,

title = "A personal perspective on keyword search over data graphs",

abstract = "Theoretical and practical issues pertaining to keyword search over data graphs are discussed. A formal model and algo rithms for enumerating answers (by operating directly on the data graph) are described. Various aspects of a system are explained, including the object-connector-property data model, how it is used to construct a data graph from an XML document, how to deal with redundancies in the source data, what are duplicate answers, implementation and GUI. An approach to ranking that combines textual relevance with semantic considerations is described. It is argued that search over data graphs is inherently a two-dimensional process, where the goal is not just to find particular content but also to collect information on how the desired data may be semantically connected.",

keywords = "Data graph, Enumeration algorithm, Graph search, Information retrieval, Search",

author = "Yehoshua Sagiv",

year = "2013",

doi = "10.1145/2448496.2448500",

language = "אנגלית",

isbn = "9781450315982",

series = "ACM International Conference Proceeding Series",

pages = "21--32",

booktitle = "ICDT 2013 - 16th International Conference on Database Theory, Proceedings",

note = "16th International Conference on Database Theory, ICDT 2013 ; Conference date: 18-03-2013 Through 22-03-2013",

}

TY - GEN

T1 - A personal perspective on keyword search over data graphs

AU - Sagiv, Yehoshua

PY - 2013

Y1 - 2013

N2 - Theoretical and practical issues pertaining to keyword search over data graphs are discussed. A formal model and algo rithms for enumerating answers (by operating directly on the data graph) are described. Various aspects of a system are explained, including the object-connector-property data model, how it is used to construct a data graph from an XML document, how to deal with redundancies in the source data, what are duplicate answers, implementation and GUI. An approach to ranking that combines textual relevance with semantic considerations is described. It is argued that search over data graphs is inherently a two-dimensional process, where the goal is not just to find particular content but also to collect information on how the desired data may be semantically connected.

AB - Theoretical and practical issues pertaining to keyword search over data graphs are discussed. A formal model and algo rithms for enumerating answers (by operating directly on the data graph) are described. Various aspects of a system are explained, including the object-connector-property data model, how it is used to construct a data graph from an XML document, how to deal with redundancies in the source data, what are duplicate answers, implementation and GUI. An approach to ranking that combines textual relevance with semantic considerations is described. It is argued that search over data graphs is inherently a two-dimensional process, where the goal is not just to find particular content but also to collect information on how the desired data may be semantically connected.

KW - Data graph

KW - Enumeration algorithm

KW - Graph search

KW - Information retrieval

KW - Search

UR - http://www.scopus.com/inward/record.url?scp=84875631755&partnerID=8YFLogxK

U2 - 10.1145/2448496.2448500

DO - 10.1145/2448496.2448500

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84875631755

SN - 9781450315982

T3 - ACM International Conference Proceeding Series

SP - 21

EP - 32

BT - ICDT 2013 - 16th International Conference on Database Theory, Proceedings

T2 - 16th International Conference on Database Theory, ICDT 2013

Y2 - 18 March 2013 through 22 March 2013

ER -

A personal perspective on keyword search over data graphs

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this