@article {16479,
	title = {Logic-based query optimization for object databases},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {12},
	year = {2000},
	month = {2000/08//Jul},
	pages = {529 - 547},
	abstract = {We present a technique for transferring query optimization techniques, developed for relational databases, into object databases. We demonstrate this technique for ODMG database schemas defined in ODL and object queries expressed in OQL. The object schema is represented using a logical representation (Datalog). Semantic knowledge about the object data model, e.g., class hierarchy information, relationship between objects, etc., as well as semantic knowledge about a particular schema and application domain are expressed as integrity constraints. An OQL object query is represented as a logic query and query optimization is performed in the Datalog representation. We obtain equivalent (optimized) logic queries, and subsequently obtain equivalent (optimized) OQL queries for each equivalent logic query. We present one optimization technique for semantic query optimization (SQO) based on the residue technique of U. Charavarthy et al. (1990; 1986; 1988). We show that our technique generalizes previous research on SQO for object databases. We handle a large class of OQL queries, including queries with constructors and methods. We demonstrate how SQO can be used to eliminate queries which contain contradictions and simplify queries, e.g., by eliminating joins, or by reducing the access scope for evaluating a query to some specific subclass(es). We also demonstrate how the definition of a method or integrity constraints describing the method, can be used in optimizing a query with a method},
	keywords = {access scope, application domain, class hierarchy information, Constraint optimization, data integrity, Data models, Datalog, Datalog representation, deductive databases, equivalent logic query, integrity constraints, Lifting equipment, Logic, logic based query optimization, logic programming, logic queries, logic query, logical representation, object data model, object databases, object queries, object schema, object-oriented databases, ODL, ODMG database schemas, optimization technique, optimized OQL queries, OQL object query, query languages, Query optimization, query optimization techniques, Query processing, Relational databases, residue technique, semantic knowledge, semantic query optimization},
	isbn = {1041-4347},
	doi = {10.1109/69.868906},
	author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa}
}
@conference {17056,
	title = {Design and evaluation of incremental data structures and algorithms for dynamic query interfaces},
	booktitle = {IEEE Symposium on Information Visualization, 1997. Proceedings},
	year = {1997},
	month = {1997/10/21/21},
	pages = {81 - 86},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A dynamic query interface (DQI) is a database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that work well with large databases, both in theory and in practice.},
	keywords = {Algorithm design and analysis, Bars, Computer science, continuous real-time feedback, Data structures, data visualisation, Data visualization, database access mechanism, Displays, DQI algorithms, dynamic query interfaces, Feedback, Graphical user interfaces, Heuristic algorithms, incremental data structures, Information Visualization, large databases, Manipulator dynamics, NASA, query formulation, query languages, Query processing, real-time systems, small databases, User interfaces, very large databases, visual databases, visual languages},
	isbn = {0-8186-8189-6},
	doi = {10.1109/INFVIS.1997.636790},
	author = {Tanin,E. and Beigel,R. and Shneiderman, Ben}
}
@conference {16781,
	title = {An algebra and calculus for relational multidatabase systems},
	booktitle = {, First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS {\textquoteright}91. Proceedings},
	year = {1991},
	month = {1991/04//},
	pages = {118 - 124},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {With the existence of many autonomous databases widely accessible through computer networks, users will require the capability to jointly manipulate data in different databases. A multidatabase system provides such a capability through a multidatabase manipulation language. The authors propose a theoretical foundation for such languages by presenting a multirelational algebra and calculus based on the relational algebra and calculus. The proposal is illustrated by various queries on an example multidatabase},
	keywords = {Algebra, autonomous databases, Calculus, Computer networks, Computer science, Data models, Data structures, Database systems, database theory, distributed databases, Military computing, multidatabase manipulation language, multidatabase system, multirelational algebra, query languages, relational algebra, Relational databases, Spatial databases, theoretical foundation},
	isbn = {0-8186-2205-9},
	doi = {10.1109/IMS.1991.153694},
	author = {Grant,J. and Litwin,W. and Roussopoulos, Nick and Sellis,T.}
}
@article {16791,
	title = {An efficient pictorial database system for PSQL},
	journal = {IEEE Transactions on Software Engineering},
	volume = {14},
	year = {1988},
	month = {1988/05//},
	pages = {639 - 650},
	abstract = {Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. A description is given of PSQL, a query language that allows pictorial domains to be presented to the user in their analog form and allows him or her to do direct manipulation on the objects found on those domains. Direct spatial search and computation on the pictures is done using efficient data structures, R- and R+-trees (multidimensional B-trees), which are excellent devices for searching spatial objects and relationships found on pictures},
	keywords = {alphanumeric encodings, Computer science, Data structures, Database languages, database management systems, Database systems, Encoding, Image coding, Image databases, multidimensional B-trees, Object oriented databases, pictorial database system, PSQL, query language, query languages, R+-trees, Relational databases, Spatial databases, spatial objects, spatial search, User interfaces},
	isbn = {0098-5589},
	doi = {10.1109/32.6141},
	author = {Roussopoulos, Nick and Faloutsos,C. and Sellis,T.}
}
@conference {17318,
	title = {Path expressions for complex queries and automatic database program conversion},
	booktitle = {Proceedings of the sixth international conference on Very Large Data Bases - Volume 6},
	series = {VLDB {\textquoteright}80},
	year = {1980},
	month = {1980///},
	pages = {33 - 44},
	publisher = {VLDB Endowment},
	organization = {VLDB Endowment},
	abstract = {Our efforts to develop an automatic database system conversion facility yielded a powerful, yet simple query language which was designed for ease of conversion. The path expression of this query language is a convenient and appealing notation for describing complex traversals with multiple boolean qualifications. This paper describes the path expression, shows how automatic conversions can be done, introduces the boolean functions as part of the basic path expression, offers four extensions (path macros, implied path, path replacement, and path optimization), and discusses some implementation issues.},
	keywords = {data definition language, data manipulation language, Database conversion, Database systems, path expressions, program conversion, query languages, transformation language},
	url = {http://dl.acm.org/citation.cfm?id=1286887.1286891},
	author = {Shneiderman, Ben and Thomas,Glenn}
}
@article {17226,
	title = {Improving the human factors aspect of database interactions},
	journal = {ACM Trans. Database Syst.},
	volume = {3},
	year = {1978},
	month = {1978/12//},
	pages = {417 - 439},
	abstract = {The widespread dissemination of computer and information systems to nontechnically trained individuals requires a new approach to the design and development of database interfaces. This paper provides the motivational background for controlled psychological experimentation in exploring the person/machine interface. Frameworks for the reductionist approach are given, research methods discussed, research issues presented, and a small experiment is offered as an example of what can be accomplished. This experiment is a comparison of natural and artificial language query facilities. Although subjects posed approximately equal numbers of valid queries with either facility, natural language users made significantly more invalid queries which could not be answered from the database that was described.},
	keywords = {Data models, Database systems, experimentation, human factors, natural language interfaces, Psychology, query languages},
	isbn = {0362-5915},
	doi = {10.1145/320289.320295},
	url = {http://doi.acm.org/10.1145/320289.320295},
	author = {Shneiderman, Ben}
}
