The Experts below are selected from a list of 408 Experts worldwide ranked by ideXlab platform
Hosagrahar Visvesvaraya Jagadish - One of the best experts on this subject based on the ideXlab platform.
-
NaLIX: A Generic Natural Language Search Environment for XML Data
2008Co-Authors: Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression. The translation is based on mapping grammatical proximity of natural language parsed tokens in the parse tree of the query sentence to proximity of corresponding elements in the XML data to be retrieved. Iterative search in the form of follow-up queries is also supported. Our experimental assessment, through a user study, demonstrates that this type of natural language interface is good enough to be usable now, with no restrictions on the application domain
-
Constructing a Generic Natural Language Interface for an XML Database
Advances in Database Technology - EDBT 2006, 2006Co-Authors: Yunyao Li, Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression. The translation is based on mapping grammatical proximity of natural language parsed tokens in the parse tree of the query sentence to proximity of corresponding elements in the XML data to be retrieved. Our experimental assessment, through a user study, demonstrates that this type of natural language interface is good enough to be usable now, with no restrictions on the application domain.
-
Nalix:an Interactive Natural Language Interface for Query ing XML, SIGMOD
2005Co-Authors: Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy grail has been the development of a natural language query interface. We present NaLIX, a generic interactive natural language query interface to an XML database. Our system can accept an arbitrary English language sentence as query input, which can include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression that can be evaluated against an XML database. The translation is done through mapping grammatical proximity of natural language parsed tokens to proximity of corresponding elements in the result XML. In this demonstration, we show that NaLIX, while far from being able to pass the Turing test, is perfectly usable in practice, and able to handle even quite complex queries in a variety of application domains. In addition, we also demonstrate how carefully designed features in NaLIX facilitate the interactive query process and improve the usability of the interface. 1
-
NaLIX: an Interactive Natural Language Interface for Querying XML
2005Co-Authors: Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy grail has been the development of a natural language query interface. We present NaLIX, a generic interactive natural language query interface to an XML database. Our system can accept an arbitrary English language sentence as query input, which can include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression that can be evaluated against an XML database. The translation is done through mapping grammatical proximity of natural language parsed tokens to proximity of corresponding elements in the result XML. In this demonstration, we show that NaLIX, while far from being able to pass the Turing test, is perfectly usable in practice, and able to handle even quite complex queries in a variety of application domains. In addition, we also demonstrate how carefully designed features in NaLIX facilitate the interactive query process and improve the usability of the interface
Huahai Yang - One of the best experts on this subject based on the ideXlab platform.
-
NaLIX: A Generic Natural Language Search Environment for XML Data
2008Co-Authors: Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression. The translation is based on mapping grammatical proximity of natural language parsed tokens in the parse tree of the query sentence to proximity of corresponding elements in the XML data to be retrieved. Iterative search in the form of follow-up queries is also supported. Our experimental assessment, through a user study, demonstrates that this type of natural language interface is good enough to be usable now, with no restrictions on the application domain
-
Constructing a Generic Natural Language Interface for an XML Database
Advances in Database Technology - EDBT 2006, 2006Co-Authors: Yunyao Li, Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression. The translation is based on mapping grammatical proximity of natural language parsed tokens in the parse tree of the query sentence to proximity of corresponding elements in the XML data to be retrieved. Our experimental assessment, through a user study, demonstrates that this type of natural language interface is good enough to be usable now, with no restrictions on the application domain.
-
Nalix:an Interactive Natural Language Interface for Query ing XML, SIGMOD
2005Co-Authors: Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy grail has been the development of a natural language query interface. We present NaLIX, a generic interactive natural language query interface to an XML database. Our system can accept an arbitrary English language sentence as query input, which can include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression that can be evaluated against an XML database. The translation is done through mapping grammatical proximity of natural language parsed tokens to proximity of corresponding elements in the result XML. In this demonstration, we show that NaLIX, while far from being able to pass the Turing test, is perfectly usable in practice, and able to handle even quite complex queries in a variety of application domains. In addition, we also demonstrate how carefully designed features in NaLIX facilitate the interactive query process and improve the usability of the interface. 1
-
NaLIX: an Interactive Natural Language Interface for Querying XML
2005Co-Authors: Huahai Yang, Hosagrahar Visvesvaraya JagadishAbstract:Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy grail has been the development of a natural language query interface. We present NaLIX, a generic interactive natural language query interface to an XML database. Our system can accept an arbitrary English language sentence as query input, which can include aggregation, nesting, and value joins, among other things. This query is translated, potentially after reformulation, into an Xquery Expression that can be evaluated against an XML database. The translation is done through mapping grammatical proximity of natural language parsed tokens to proximity of corresponding elements in the result XML. In this demonstration, we show that NaLIX, while far from being able to pass the Turing test, is perfectly usable in practice, and able to handle even quite complex queries in a variety of application domains. In addition, we also demonstrate how carefully designed features in NaLIX facilitate the interactive query process and improve the usability of the interface
Torsten Grust - One of the best experts on this subject based on the ideXlab platform.
-
pathfinder a relational query optimizer explores Xquery terrain
BTW, 2007Co-Authors: Jan Rittinger, Jens Teubner, Torsten GrustAbstract:Relational encodings of the static aspects of the Xquery data model, i.e., tabular representations for XML documents and ordered sequences of items, are widely used today. Since 2002, the Pathfinder andMonetDB/Xquery companion projects [BGvK06] pursue the primary goal to also embrace the complete dynamic semantics of Xquery (Expression evaluation and runtime aspects) with the help of relational database systems.
-
Pathfinder: A Relational Query Optimizer Explores Xquery Terrain
2007Co-Authors: Jan Rittinger, Jens Teubner, Torsten GrustAbstract:Relational encodings of the static aspects of the Xquery data model, i.e., tabular representations for XML documents and ordered sequences of items, are widely used today. Since 2002, the Pathfinder and MonetDB/Xquery companion projects [BGvK + 06] pursue the primary goal to also embrace the complete dynamic semantics of Xquery (Expression evaluation and runtime aspects) with the help of relational database systems. In earlier work [GT04], we have shown that relational algebra makes for a suitable target language in an Xquery compiler. This purely relational approach to Xquery inherits the scalability advantages of the underlying relational database back-end and makes proven optimization techniques immediately applicable to the construction of Xquery processors. MonetDB/Xquery, an open-source system that implements this approach, is found among the fastest and most scalable Xquery processors available today [BGvK + 06]. This is a demonstration of the relational optimizer of Pathfinder 1, the query compiler behind MonetDB/Xquery. To account for the significant size and unusual shape of the relational query plans (see Figure 1) derived from input Xquery Expressions, Pathfinder implements various optimization techniques in a peephole-style fashion and provides support for graph-shaped plans from the ground up. 2 Relational Query Optimization in an Xquery Compiler Pathfinder’s Xquery compiler turns incoming Xquery Expressions into relational query plans according to the loop-lifting compilation strategy we devised in [GT04]. In a nutshell, loop-lifting trades iteration (esp. the Xquery FLWOR construct) for efficient bulkoriented processing. The compiler emits Expressions of a relational algebra whose operators have been chosen to match the actual capabilities of modern SQL query engines. A few representative operators are shown in Table 1 (note that non-standard operators like the XPath step join ¢ are synonyms for relational “micro-plans ” with an optimized implementation in Pathfinder’s back-end database system MonetDB). 1 MonetDB/Xquery and Pathfinder are available vi
Arijit Sengupta - One of the best experts on this subject based on the ideXlab platform.
-
Access control for XML - a dynamic query rewriting approach
2015Co-Authors: Sriram Mohan, Arijit SenguptaAbstract:Being able to express and enforce role-based access control on XML data is a critical component of XML data manage-ment. However, given the semi-structured nature of XML, this is non-trivial, as access control can be applied on the values of nodes as well as on the structural relationship be-tween nodes. In this context, we adopt and extend a graph editing language for specifying role-based access constraints in the form of security views. A Security Annotated Schema (SAS) is proposed as the internal representation for the se-curity views and can be automatically constructed from the original schema and the security view specication. To en-force the access constraints on user queries, we propose Se-cure Query Rewrite (SQR)- a set of rules that can be used to rewrite a user XPath query on the security view into an equivalent Xquery Expression against the original data, with the guarantee that the users only see information in the view but not any data that was blocked. Experimental evalua-tion demonstrates the eciency and the expressiveness of our approach
-
Access control for XML - a dynamic query rewriting approach
2005Co-Authors: Sriram Mohan, Arijit Sengupta, Jonathan KlinginsmithAbstract:We introduce the notion of views as a mechanism for securing and providing access control in the context of XML. Research in XML has explored several efficient querying mechanisms. Hiding sensitive data from unauthorized users is as important as supporting efficient querying of visible data. However, given the semi-structured nature of XML data, this is non-trivial, as access control can be applied on the values of nodes as well as on the structural relationship between nodes. In this context, we present an algebraic security view specification language SSX for DBAs to specify security constraints for different user groups. A Security Annotated Schema (SAS) is proposed as the internal representation for the security views and can be automatically constructed from the original schema and the security view specification sequence used to define the security constraint. We also propose a set of rules that can be used to rewrite user XPath queries on the security view into an equivalent Xquery Expression that can be executed against the original data, with the guarantee that the users only see information in the view and not infer any data that was blocked. Experimental evaluation demonstrates that our approach is expressive and efficient.
Jan Rittinger - One of the best experts on this subject based on the ideXlab platform.
-
pathfinder a relational query optimizer explores Xquery terrain
BTW, 2007Co-Authors: Jan Rittinger, Jens Teubner, Torsten GrustAbstract:Relational encodings of the static aspects of the Xquery data model, i.e., tabular representations for XML documents and ordered sequences of items, are widely used today. Since 2002, the Pathfinder andMonetDB/Xquery companion projects [BGvK06] pursue the primary goal to also embrace the complete dynamic semantics of Xquery (Expression evaluation and runtime aspects) with the help of relational database systems.
-
Pathfinder: A Relational Query Optimizer Explores Xquery Terrain
2007Co-Authors: Jan Rittinger, Jens Teubner, Torsten GrustAbstract:Relational encodings of the static aspects of the Xquery data model, i.e., tabular representations for XML documents and ordered sequences of items, are widely used today. Since 2002, the Pathfinder and MonetDB/Xquery companion projects [BGvK + 06] pursue the primary goal to also embrace the complete dynamic semantics of Xquery (Expression evaluation and runtime aspects) with the help of relational database systems. In earlier work [GT04], we have shown that relational algebra makes for a suitable target language in an Xquery compiler. This purely relational approach to Xquery inherits the scalability advantages of the underlying relational database back-end and makes proven optimization techniques immediately applicable to the construction of Xquery processors. MonetDB/Xquery, an open-source system that implements this approach, is found among the fastest and most scalable Xquery processors available today [BGvK + 06]. This is a demonstration of the relational optimizer of Pathfinder 1, the query compiler behind MonetDB/Xquery. To account for the significant size and unusual shape of the relational query plans (see Figure 1) derived from input Xquery Expressions, Pathfinder implements various optimization techniques in a peephole-style fashion and provides support for graph-shaped plans from the ground up. 2 Relational Query Optimization in an Xquery Compiler Pathfinder’s Xquery compiler turns incoming Xquery Expressions into relational query plans according to the loop-lifting compilation strategy we devised in [GT04]. In a nutshell, loop-lifting trades iteration (esp. the Xquery FLWOR construct) for efficient bulkoriented processing. The compiler emits Expressions of a relational algebra whose operators have been chosen to match the actual capabilities of modern SQL query engines. A few representative operators are shown in Table 1 (note that non-standard operators like the XPath step join ¢ are synonyms for relational “micro-plans ” with an optimized implementation in Pathfinder’s back-end database system MonetDB). 1 MonetDB/Xquery and Pathfinder are available vi
