@article {17250,
	title = {Interactive Entity Resolution in Relational Data: A Visual Analytic Tool and Its Evaluation},
	journal = {IEEE Transactions on Visualization and Computer Graphics},
	volume = {14},
	year = {2008},
	month = {2008/10//Sept},
	pages = {999 - 1014},
	abstract = {Databases often contain uncertain and imprecise references to real-world entities. Entity resolution, the process of reconciling multiple references to underlying real-world entities, is an important data cleaning process required before accurate visualization or analysis of the data is possible. In many cases, in addition to noisy data describing entities, there is data describing the relationships among the entities. This relational data is important during the entity resolution process; it is useful both for the algorithms which determine likely database references to be resolved and for visual analytic tools which support the entity resolution process. In this paper, we introduce a novel user interface, D-Dupe, for interactive entity resolution in relational data. D-Dupe effectively combines relational entity resolution algorithms with a novel network visualization that enables users to make use of an entity{\textquoteright}s relational context for making resolution decisions. Since resolution decisions often are interdependent, D-Dupe facilitates understanding this complex process through animations which highlight combined inferences and a history mechanism which allows users to inspect chains of resolution decisions. An empirical study with 12 users confirmed the benefits of the relational context visualization on the performance of entity resolution tasks in relational data in terms of time as well as users{\textquoteright} confidence and satisfaction.},
	keywords = {algorithms, Computer Graphics, D-Dupe, data visualisation, database management systems, Databases, Factual, graphical user interface, Graphical user interfaces, human-centered computing, Image Interpretation, Computer-Assisted, Information Storage and Retrieval, Information Visualization, interactive entity resolution, relational context visualization, Relational databases, relational entity resolution algorithm, User interfaces, user-centered design, User-Computer Interface, visual analytic tool},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2008.55},
	author = {Kang,Hyunmo and Getoor, Lise and Shneiderman, Ben and Bilgic,M. and Licamele,L.}
}
@conference {13393,
	title = {Online Filtering, Smoothing and Probabilistic Modeling of Streaming data},
	booktitle = {IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008},
	year = {2008},
	month = {2008/04/07/12},
	pages = {1160 - 1169},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. We use the recently proposed abstraction of model-based views for this purpose, by allowing users to declaratively specify the model to be applied, and by presenting the output of the models to the user as a probabilistic database view. We support declarative querying over such views using an extended version of SQL that allows for querying probabilistic data. Underneath we use particle filters, a class of sequential Monte Carlo algorithms, to represent the present and historical states of the model as sets of weighted samples (particles) that are kept up-to-date as new data arrives. We develop novel techniques to convert the queries on the model-based view directly into queries over particle tables, enabling highly efficient query processing. Finally, we present experimental evaluation of our prototype implementation over several synthetic and real datasets, that demonstrates the feasibility of online modeling of streaming data using our system and establishes the advantages of tight integration between dynamic probabilistic models and databases.},
	keywords = {Data analysis, data streaming, declarative query, dynamic probabilistic model, Filtering, Global Positioning System, hidden Markov models, Monitoring, Monte Carlo methods, Noise generators, Noise measurement, online filtering, particle filter, particle filtering (numerical methods), probabilistic database view, probability, Real time systems, real-time application, relational database system, Relational databases, sequential Monte Carlo algorithm, Smoothing methods, SQL},
	isbn = {978-1-4244-1836-7},
	doi = {10.1109/ICDE.2008.4497525},
	author = {Kanagal,B. and Deshpande, Amol}
}
@book {14505,
	title = {Introduction to Statistical Relational Learning},
	year = {2007},
	month = {2007/11/30/},
	publisher = {MIT Press},
	organization = {MIT Press},
	abstract = {Handling inherent uncertainty and exploiting compositional structure are fundamental to understanding and designing large-scale systems. Statistical relational learning builds on ideas from probability theory and statistics to address uncertainty while incorporating tools from logic, databases and programming languages to represent structure. In Introduction to Statistical Relational Learning, leading researchers in this emerging area of machine learning describe current formalisms, models, and algorithms that enable effective and robust reasoning about richly structured systems and data. The early chapters provide tutorials for material used in later chapters, offering introductions to representation, inference and learning in graphical models, and logic. The book then describes object-oriented approaches, including probabilistic relational models, relational Markov networks, and probabilistic entity-relationship models as well as logic-based formalisms including Bayesian logic programs, Markov logic, and stochastic logic programs. Later chapters discuss such topics as probabilistic models with unknown objects, relational dependency networks, reinforcement learning in relational domains, and information extraction. By presenting a variety of approaches, the book highlights commonalities and clarifies important differences among proposed approaches and, along the way, identifies important representational and algorithmic issues. Numerous applications are provided throughout.Lise Getoor is Assistant Professor in the Department of Computer Science at the University of Maryland. Ben Taskar is Assistant Professor in the Computer and Information Science Department at the University of Pennsylvania.},
	keywords = {Business \& Economics / Statistics, Computer algorithms, Computers / Database Management / General, Computers / Logic Design, Computers / Machine Theory, Computers / Programming / Algorithms, Education / Statistics, machine learning, Machine learning - Statistical methods, Machine learning/ Statistical methods, Relational databases},
	isbn = {9780262072885},
	author = {Getoor, Lise}
}
@conference {13402,
	title = {Representing Tuple and Attribute Uncertainty in Probabilistic Databases},
	booktitle = {Seventh IEEE International Conference on Data Mining Workshops, 2007. ICDM Workshops 2007},
	year = {2007},
	month = {2007/10/28/31},
	pages = {507 - 512},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources-sensor data, experimental data, data from uncurated sources, and many others. There is a growing need to be able to flexibly represent the uncertainties in the data, and to efficiently query the data. Building on existing probabilistic database work, we present a unifying framework which allows a flexible representation of correlated tuple and attribute level uncertainties. An important capability of our representation is the ability to represent shared correlation structures in the data. We provide motivating examples to illustrate when such shared correlation structures are likely to exist. Representing shared correlations structures allows the use of sophisticated inference techniques based on lifted probabilistic inference that, in turn, allows us to achieve significant speedups while computing probabilities for results of user-submitted queries.},
	keywords = {attribute uncertainty, Computer science, Conferences, correlation structures, data mining, Data models, database management systems, Educational institutions, inference mechanisms, noisy data sources, probabilistic database, probabilistic inference, Probability distribution, Query processing, Relational databases, Sensor phenomena and characterization, tuple representation, Uncertainty, uncertainty handling},
	isbn = {978-0-7695-3019-2},
	doi = {10.1109/ICDMW.2007.11},
	author = {Sen,P. and Deshpande, Amol and Getoor, Lise}
}
@conference {13363,
	title = {Decoupled query optimization for federated database systems},
	booktitle = {18th International Conference on Data Engineering, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {716 - 727},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the "cost of costing" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication. In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss tradeoffs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise},
	keywords = {Algorithm design and analysis, Cohera federated database, Computer science, Corporate acquisitions, Cost function, Database systems, decoupled optimization, Design optimization, distributed databases, federated databases, federated relational database systems, Internet, Query optimization, query optimizer, Query processing, Relational databases, Space exploration},
	isbn = {0-7695-1531-2},
	doi = {10.1109/ICDE.2002.994788},
	author = {Deshpande, Amol and Hellerstein,J. M}
}
@conference {17859,
	title = {Scheduling multiple data visualization query workloads on a shared memory machine},
	booktitle = {Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM},
	year = {2002},
	month = {2002///},
	pages = {11 - 18},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets as well as intermediate results are maintained in memory to speed up query evaluation. We present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a shared-memory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images},
	keywords = {Atomic force microscopy, Biomedical informatics, Computer science, Data analysis, data visualisation, Data visualization, datasets, deductive databases, digitized microscopy image browsing, directed graph, directed graphs, dynamic query scheduling model, Educational institutions, high workloads, image database, limited resources, multiple data visualization query workloads, multiple query optimization, performance, priority queue, Processor scheduling, Query processing, query ranking, Relational databases, scheduling, shared memory machine, shared memory systems, Virtual Microscope, visual databases},
	isbn = {0-7695-1573-8},
	doi = {10.1109/IPDPS.2002.1015482},
	author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@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 {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 {16764,
	title = {Incremental implementation model for relational databases with transaction time},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {3},
	year = {1991},
	month = {1991/12//},
	pages = {461 - 473},
	abstract = {An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental computations of requested views, making it more flexible than previously proposed partitioned storage models. The working and the expressiveness of the model are demonstrated by sample queries that show how historical data are retrieved},
	keywords = {Computational modeling, Computer science, Data models, data retrieval, Database languages, Database systems, database theory, decremental computations, deferred update, Degradation, differential computation, historical data, History, incremental computations, Information retrieval, partitioned storage models, queries, relational data model, Relational databases, stored views, Transaction databases, transaction time, view materialization},
	isbn = {1041-4347},
	doi = {10.1109/69.109107},
	author = {Jensen,C. S and Mark,L. and Roussopoulos, Nick}
}
@conference {14575,
	title = {Parallel transitive closure computations using topological sort},
	booktitle = {, Proceedings of the First International Conference on Parallel and Distributed Information Systems, 1991},
	year = {1991},
	month = {1991/12/04/6},
	pages = {122 - 129},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Deals with parallel transitive closure computations. The sort-based approaches introduced sorts the tuples of the relation into topological order, and the sorted relation is then horizontally partitioned and distributed across several processing nodes of a message passing multiprocessor system. This data partitioning strategy allows the transitive closure computation of the local data fragments to be computed in parallel with no interprocessor communication. The construction of the final result then requires only a small number of joins. Extensive analytical results are included in the paper as well. They show that the proposed techniques leads to a speedup that is essentially linear with the number of processors. Its performance is significantly better than the recently published hashless parallel algorithm},
	keywords = {Computer science, Concurrent computing, data partitioning, Database systems, database theory, deductive databases, File systems, horizontal partitioning, joins, local data fragments, message passing multiprocessor system, Multiprocessing systems, Parallel algorithms, PARALLEL PROCESSING, parallel programming, parallel transitive closure, processing nodes, relation tuples, Relational databases, sorting, topological sort},
	isbn = {0-8186-2295-4},
	doi = {10.1109/PDIS.1991.183079},
	author = {Hua,K. A and Hannenhalli, Sridhar}
}
@article {16768,
	title = {A pipeline N-way join algorithm based on the 2-way semijoin program},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {3},
	year = {1991},
	month = {1991/12//},
	pages = {486 - 495},
	abstract = {The semijoin has been used as an effective operator in reducing data transmission and processing over a network that allows forward size reduction of relations and intermediate results generated during the processing of a distributed query. The authors propose a relational operator, two-way semijoin, which enhanced the semijoin with backward size reduction capability for more cost-effective query processing. A pipeline N-way join algorithm for joining the reduced relations residing on N sites is introduced. The main advantage of this algorithm is that it eliminates the need for transferring and storing intermediate results among the sites. A set of experiments showing that the proposed algorithm outperforms all known conventional join algorithms that generate intermediate results is included},
	keywords = {2-way semijoin program, backward size reduction, Bandwidth, Computer networks, Costs, Data communication, data transmission, Database systems, database theory, Delay, distributed databases, distributed query, forward size reduction, intermediate results, Local area networks, network, Parallel algorithms, pipeline N-way join algorithm, pipeline processing, Pipelines, programming theory, Query processing, Relational databases, relational operator, SITES, Workstations},
	isbn = {1041-4347},
	doi = {10.1109/69.109109},
	author = {Roussopoulos, Nick and Kang,H.}
}
@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.}
}
@article {16751,
	title = {SEES{\textemdash}A Software testing Environment Support System},
	journal = {IEEE Transactions on Software Engineering},
	volume = {SE-11},
	year = {1985},
	month = {1985/04//},
	pages = {355 - 366},
	abstract = {SEES is a database system to support program testing. The program database is automatically created during the compilation of the program by a compiler built using the YACC compiler-compiler.},
	keywords = {Computer architecture, Database systems, Error correction, Program processors, Programming profession, Relational databases, Software testing, software tools, Workstations, Writing},
	isbn = {0098-5589},
	doi = {10.1109/TSE.1985.232225},
	author = {Roussopoulos, Nick and Yeh,R. T}
}
