Examining users' partial query modification patterns in voice search

The Web has become a huge and indispensable source of information to be used and shared globally, where knowledge is commonly represented and stored in RDF, or alternatively, in conceptual graphs. Managing and searching for web information have gone beyond the relational database model, as the data are semi-structured and inexact answers are often the case. Usually, approximate searching results are due to mismatching between entity types and names in a query and an answer. Firstly, this research work focuses on partial subsumption of a query graph to an answer graph, which is an unsymmetric measure in contrast to similarity. Secondly, it proposes a population-based method for defining subsumption degrees between entity types, one to another, and a class-sensitive soft TF-IDF method for entity names. Lastly, on the one hand, for a user-friendly interface and easily readable query expressions, conceptual graphs are employed at the front-end. On the other hand, in order to take the advantage of the existing platform of SeRQL, an exact RDF query language, the query modification tactic is used to retrieve the knowledge graphs that are close to a query graph, before the subsumption degrees of the query graph to those answer graphs are calculated.

Download Full-text

A constraint-based query modification engine for retrofitting COTS DBMS's

International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. ◽

10.1109/itcc.2004.1286521 ◽

2004 ◽

Cited By ~ 1

Author(s):

M. Garuba ◽

R. Langrin ◽

L. Burge

Keyword(s):

Query Modification

Download Full-text

Collaborative Retrieval Systems

Collaborative Technologies and Applications for Interactive Information Design ◽

10.4018/978-1-60566-727-0.ch009 ◽

2010 ◽

pp. 126-136

Author(s):

Ying Sun

Keyword(s):

Information Needs ◽

Retrieval Systems ◽

Collaborative Search ◽

Query Representation ◽

The Difference ◽

Query Modification

Collaborative search generally uses previously collected search sessions as a resource to help future users to improve their searching by query modification. The recommendation or automatic extension of the query is generally based on the content of the old sessions, or purely the sequence/order of queries/ texts in a session, or a combination. However, users with the same expressed query may need different information. The difference may not be topic related. This chapter proposes to enrich the context of query representation to incorporate non-topical properties of user information needs, which the authors believe will improve the results of collaborative search.

Download Full-text

Fine-Grained Data Access for Networking Applications

Encyclopedia of Multimedia Technology and Networking, Second Edition ◽

10.4018/978-1-60566-014-1.ch076 ◽

2009 ◽

pp. 568-573 ◽

Cited By ~ 2

Author(s):

Harith Indraratne ◽

Gábor Hosszú

Keyword(s):

Access Control ◽

Data Access ◽

Fine Grained ◽

Security Issues ◽

Network Applications ◽

Access Controls ◽

User Data ◽

Secure Network ◽

Data Separation ◽

Query Modification

Current-day network applications require much more secure data storages than anticipated before. With millions of anonymous users using same networking applications, security of data behind the applications have become a major concern of database developers and security experts. In most security incidents, the databases attached to the applications are targeted, and attacks have been made. Most of these applications require allowing data manipulation at several granular levels to the users accessing the applications—not just table and view level, but tuple level. A database that supports fine-grained access control restricts the rows a user sees, based on his/her credentials. Generally, this restriction is enforced by a query modification mechanism automatically done at the database. This feature enables per-user data access within a single database, with the assurance of physical data separation. It is enabled by associating one or more security policies with tables, views, table columns, and table rows. Such a model is ideal for minimizing the complexity of the security enforcements in databases based on network applications. With fine-grained access controls, one can create fast, scalable, and secure network applications. Each application can be written to find the correct balance between performance and security, so that each data transaction is performed as quickly and safely as possible. Today, the database vendors like Oracle 10g, and IBM DB2 provides commercial implementations of fine-grained access control methods, such as filtering rows, masking columns selectively based on the policy, and applying the policy only when certain columns are accessed. The behavior of the fine-grained access control model can also be increased through the use of multiple types of policies based on the nature of the application, making the feature applicable to multiple situations. Meanwhile, Microsoft SQL Server2005 has also come up with emerging features to control the access to databases using fine-grained access controls. Fine-grained access control does not cover all the security issues related to Internet databases, but when implemented, it supports building secure databases rapidly and bringing down the complexity of security management issues.

Download Full-text