@article {14415,
	title = {Organizing User Search Histories},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {24},
	year = {2012},
	month = {2012/05//},
	pages = {912 - 925},
	abstract = {Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user{\textquoteright}s historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a number of different search engine components and applications, such as query suggestions, result ranking, query alterations, sessionization, and collaborative search. In our approach, we go beyond approaches that rely on textual similarity or time thresholds, and we propose a more robust approach that leverages search query logs. We experimentally study the performance of different techniques, and showcase their potential, especially when combined together.},
	keywords = {alteration;query, analysis;user, engines;search, engines;text, goal;textual, group, historical, History, identification;query, information, interfaces;, log;sessionization;task-oriented, organization;query, processing;search, query, query;user, quest;query, ranking;search, search, search;long-term, similarity;time, suggestion;result, threshold;user, Web;collaborative},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2010.251},
	author = {Hwang,Heasoo and Lauw,H. W and Getoor, Lise and Ntoulas,A.}
}
@conference {17752,
	title = {Aggregate Query Answering under Uncertain Schema Mappings},
	booktitle = {Data Engineering, 2009. ICDE {\textquoteright}09. IEEE 25th International Conference on},
	year = {2009},
	month = {2009/04/29/2},
	pages = {940 - 951},
	abstract = {Recent interest in managing uncertainty in data integration has led to the introduction of probabilistic schema mappings and the use of probabilistic methods to answer queries across multiple databases using two semantics: by-table and by-tuple. In this paper, we develop three possible semantics for aggregate queries: the range, distribution, and expected value semantics, and show that these three semantics combine with the by-table and by-tuple semantics in six ways. We present algorithms to process COUNT, AVG, SUM, MIN, and MAX queries under all six semantics and develop results on the complexity of processing such queries under all six semantics. We show that computing COUNT is in PTIME for all six semantics and computing SUM is in PTIME for all but the by-tuple/distribution semantics. Finally, we show that AVG, MIN, and MAX are PTIME computable for all by-table semantics and for the by-tuple/range semantics.We developed a prototype implementation and experimented with both real-world traces and simulated data. We show that, as expected, naive processing of aggregates does not scale beyond small databases with a small number of mappings. The results also show that the polynomial time algorithms are scalable up to several million tuples as well as with a large number of mappings.},
	keywords = {aggregate, algorithm;probabilistic, answering;by-table, complexity;data, complexity;distributed, database;polynomial, databases;, databases;probability;query, integration;distribution, mapping;computational, mapping;query, processing;range, processing;statistical, query, schema, semantics;by-tuple, semantics;computational, semantics;expected, semantics;multiple, semantics;uncertain, TIME, value},
	doi = {10.1109/ICDE.2009.55},
	author = {Gal,A. and Martinez,M. V and Simari,G. I and V.S. Subrahmanian}
}
@conference {14846,
	title = {Using Stereo Matching for 2-D Face Recognition Across Pose},
	booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on},
	year = {2007},
	month = {2007/06//},
	pages = {1 - 8},
	abstract = {We propose using stereo matching for 2-D face recognition across pose. We match one 2-D query image to one 2-D gallery image without performing 3-D reconstruction. Then the cost of this matching is used to evaluate the similarity of the two images. We show that this cost is robust to pose variations. To illustrate this idea we built a face recognition system on top of a dynamic programming stereo matching algorithm. The method works well even when the epipolar lines we use do not exactly fit the viewpoints. We have tested our approach on the PIE dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.},
	keywords = {2D, estimation;stereo, Face, gallery, image, image;2D, image;dynamic, matching;dynamic, matching;pose, processing;, programming;face, programming;pose, query, recognition;2D, recognition;image, variation;stereo},
	doi = {10.1109/CVPR.2007.383111},
	author = {Castillo,C. D and Jacobs, David W.}
}
@conference {16085,
	title = {Exploring content-actor paired network data using iterative query refinement with NetLens},
	booktitle = {Digital Libraries, 2006. JCDL {\textquoteright}06. Proceedings of the 6th ACM/IEEE-CS Joint Conference on},
	year = {2006},
	month = {2006/06//},
	pages = {372 - 372},
	abstract = {Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper demonstrates a tool, NetLens, to explore a content-actor paired network data model. The NetLens interface was designed to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify in node-link visualizations. NetLens is general and scalable in that it applies to any dataset that can be represented with our abstract content-actor data model},
	keywords = {data, interface, libraries;query, management, model;data, models;data, NetLens;content-actor, network, pair, processing;user, query, refinement;data, retrieval;iterative, systems;, visualisation;digital, visualization;information},
	doi = {10.1145/1141753.1141868},
	author = {Lee,Bongshin and Kang,Hyunmo and Plaisant, Catherine and Bederson, Benjamin B.}
}
@conference {17790,
	title = {RDF aggregate queries and views},
	booktitle = {Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on},
	year = {2005},
	month = {2005/04//},
	pages = {717 - 728},
	abstract = {Resource description framework (RDF) is a rapidly expanding Web standard. RDF databases attempt to track the massive amounts of Web data and services available. In this paper, we study the problem of aggregate queries. We develop an algorithm to compute answers to aggregate queries over RDF databases and algorithms to maintain views involving those aggregates. Though RDF data can be stored in a standard relational DBMS (and hence we can execute standard relational aggregate queries and view maintenance methods on them), we show experimentally that our algorithms that operate directly on the RDF representation exhibit significantly superior performance.},
	keywords = {aggregate, databases;, DBMS;, description, framework;, languages;, Maintenance, methods;, processing;, queries;, query, RDF, relational, resource, standard;, standards;, view, Web},
	doi = {10.1109/ICDE.2005.121},
	author = {Hung,E. and Deng,Yu and V.S. Subrahmanian}
}
@conference {15029,
	title = {Strategies for exploring large scale data},
	booktitle = {Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on},
	year = {2004},
	month = {2004/05//},
	pages = {2 - 2},
	abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.},
	keywords = {algorithms;, association;, asymptotic, bounds;, business, data, data;, database, databases;, demographic, discovery;, Indexing, indexing;, information, knowledge, large, linear, mining;, multidimensional, objects;, optimal, Parallel, pattern, processing;, query, querying;, range, scale, scientific, search, serial, series, series;, simulation, space, structure;, structures;, techniques;, temporal, TIME, value, very, window;},
	doi = {10.1109/ISPAN.2004.1300447},
	author = {JaJa, Joseph F.}
}
@conference {16894,
	title = {Depth-first k-nearest neighbor finding using the MaxNearestDist estimator},
	booktitle = {Image Analysis and Processing, 2003.Proceedings. 12th International Conference on},
	year = {2003},
	month = {2003/09//},
	pages = {486 - 491},
	abstract = {Similarity searching is an important task when trying to find patterns in applications which involve mining different types of data such as images, video, time series, text documents, DNA sequences, etc. Similarity searching often reduces to finding the k nearest neighbors to a query object. A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch-and-bound k-nearest neighbor finding algorithm. Using the MaxNearestDist estimator (Larsen, S. and Kanal, L.N., 1986) in the depth-first k-nearest neighbor algorithm provides a middle ground between a pure depth-first and a best-first k-nearest neighbor algorithm.},
	keywords = {branch-and-bound, data, depth-first, distance;, DNA, documents;, estimation;, estimator;, finding;, images;, k-nearest, matching;, maximum, MaxNearestDist, mining;, neighbor, parameter, pattern, possible, process;, processing;, query, search, searching;, sequences;, series;, similarity, text, TIME, tree, video;},
	doi = {10.1109/ICIAP.2003.1234097},
	author = {Samet, Hanan}
}
@article {14886,
	title = {Lambertian reflectance and linear subspaces},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/02//},
	pages = {218 - 233},
	abstract = {We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace, explaining prior empirical results. We also provide a simple analytic characterization of this linear space. We obtain these results by representing lighting using spherical harmonics and describing the effects of Lambertian materials as the analog of a convolution. These results allow us to construct algorithms for object recognition based on linear methods as well as algorithms that use convex optimization to enforce nonnegative lighting functions. We also show a simple way to enforce nonnegative lighting when the images of an object lie near a 4D linear space. We apply these algorithms to perform face recognition by finding the 3D model that best matches a 2D query image.},
	keywords = {2D, 4D, 9D, analog;, analytic, characterization;, convex, convolution, distant, functions;, harmonics;, image, image;, intensities;, Lambertian, light, lighting, linear, methods;, nonnegative, normals;, object, optimization;, programming;, query, recognition;, reflectance;, reflectivity;, set;, sources;, space;, spherical, subspace;, subspaces;, surface},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1177153},
	author = {Basri,R. and Jacobs, David W.}
}
@article {16897,
	title = {Properties of embedding methods for similarity searching in metric spaces},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/05//},
	pages = {530 - 549},
	abstract = {Complex data types-such as images, documents, DNA sequences, etc.-are becoming increasingly important in modern database applications. A typical query in many of these applications seeks to find objects that are similar to some target object, where (dis)similarity is defined by some distance function. Often, the cost of evaluating the distance between two objects is very high. Thus, the number of distance evaluations should be kept at a minimum, while (ideally) maintaining the quality of the result. One way to approach this goal is to embed the data objects in a vector space so that the distances of the embedded objects approximates the actual distances. Thus, queries can be performed (for the most part) on the embedded objects. We are especially interested in examining the issue of whether or not the embedding methods will ensure that no relevant objects are left out. Particular attention is paid to the SparseMap, FastMap, and MetricMap embedding methods. SparseMap is a variant of Lipschitz embeddings, while FastMap and MetricMap are inspired by dimension reduction methods for Euclidean spaces. We show that, in general, none of these embedding methods guarantee that queries on the embedded objects have no false dismissals, while also demonstrating the limited cases in which the guarantee does hold. Moreover, we describe a variant of SparseMap that allows queries with no false dismissals. In addition, we show that with FastMap and MetricMap, the distances of the embedded objects can be much greater than the actual distances. This makes it impossible (or at least impractical) to modify FastMap and MetricMap to guarantee no false dismissals.},
	keywords = {complex, contractiveness;, data, databases;, decomposition;, dimension, distance, distortion;, DNA, documents;, EMBEDDING, embeddings;, Euclidean, evaluations;, FastMap;, images;, Lipschitz, methods;, metric, MetricMap;, multimedia, processing;, query, reduction, search;, searching;, sequences;, similarity, singular, spaces;, SparseMap;, types;, value},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1195989},
	author = {Hjaltason,G. R and Samet, Hanan}
}
@conference {14387,
	title = {PXML: a probabilistic semistructured data model and algebra},
	booktitle = {Data Engineering, 2003. Proceedings. 19th International Conference on},
	year = {2003},
	month = {2003/03//},
	pages = {467 - 478},
	abstract = {Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. We propose a model for probabilistic semistructured data (PSD). The advantage of our approach is that it supports a flexible representation that allows the specification of a wide class of distributions over semistructured instances. We provide two semantics for the model and show that the semantics are probabilistically coherent. Next, we develop an extension of the relational algebra to handle probabilistic semistructured data and describe efficient algorithms for answering queries that use this algebra. Finally, we present experimental results showing the efficiency of our algorithms.},
	keywords = {algebra;, data, databases;, instances;, model;, models;, probabilistic, processing;, PXML;, query, relational, semistructured, structures;, tree, XML;},
	doi = {10.1109/ICDE.2003.1260814},
	author = {Hung,E. and Getoor, Lise and V.S. Subrahmanian}
}
@conference {16914,
	title = {Content-based image retrieval using Fourier descriptors on a logo database},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {521 - 524 vol.3 - 521 - 524 vol.3},
	abstract = {A system that enables the pictorial specification of queries in an image database is described. The queries are comprised of rectangle, polygon, ellipse, and B-spline shapes. The queries specify which shapes should appear in the target image as well as spatial constraints on the distance between them and their relative position. The retrieval process makes use of an abstraction of the contour of the shape which is invariant against translation, scale, rotation, and starting point, that is based on the use of Fourier descriptors. These abstractions are used in a system to locate logos in an image database. The utility of this approach is illustrated using some sample queries.},
	keywords = {abstraction;, analysis;, constraints;, content-based, contour, database, database;, databases;, descriptors;, detection;, edge, Fourier, image, logos;, pictorial, processing;, query, retrieval;, SHAPE, spatial, specification;, theory;, visual},
	doi = {10.1109/ICPR.2002.1047991},
	author = {Folkers,A. and Samet, Hanan}
}
@conference {14961,
	title = {Efficient techniques for range search queries on earth science data},
	booktitle = {Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on},
	year = {2002},
	month = {2002///},
	pages = {142 - 151},
	abstract = {We consider the problem of organizing large scale earth science raster data to efficiently handle queries for identifying regions whose parameters fall within certain range values specified by the queries. This problem seems to be critical to enabling basic data mining tasks such as determining associations between physical phenomena and spatial factors, detecting changes and trends, and content based retrieval. We assume that the input is too large to fit in internal memory and hence focus on data structures and algorithms that minimize the I/O bounds. A new data structure, called a tree-of-regions (ToR), is introduced and involves a combination of an R-tree and efficient representation of regions. It is shown that such a data structure enables the handling of range queries in an optimal I/O time, under certain reasonable assumptions. We also show that updates to the ToR can be handled efficiently. Experimental results for a variety of multi-valued earth science data illustrate the fast execution times of a wide range of queries, as predicted by our theoretical analysis.},
	keywords = {based, computing;, content, data, data;, databases;, Earth, factors;, large, mining, mining;, natural, processing;, queries;, query, range, raster, retrieval;, scale, Science, sciences, search, spatial, structures;, tasks;, temporal, tree, tree-of-regions;, visual},
	doi = {10.1109/SSDM.2002.1029714},
	author = {Shi,Qingmin and JaJa, Joseph F.}
}
@conference {15524,
	title = {Semantic query optimization for object databases},
	booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on},
	year = {1997},
	month = {1997/04//},
	pages = {444 - 453},
	abstract = {Presents a technique for semantic query optimization (SQO) for object databases. We use the ODMG-93 (Object Data Management Group) standard ODL (Object Database Language) and OQL (Object Query Language) languages. The ODL object schema and the OQL object query are translated into a DATALOG representation. Semantic knowledge about the object model and the particular application is expressed as integrity constraints. This is an extension of the ODMG-93 standard. SQO is performed in the DATALOG representation, and an equivalent logic query and (subsequently) an equivalent OQL object query are obtained. SQO is based on the residue technique of Chakravarthy et al. (1990). We show that our technique generalizes previous research on SQO for object databases. It can be applied to queries with structure constructors and method application. It utilizes integrity constraints about keys, methods and knowledge of access support relations, to produce equivalent queries, which may have more efficient evaluation plans},
	keywords = {application;object, constraints;keys;method, constructors;DATALOG;data, databases;object-oriented, databases;query, Datalog, Evaluation, integrity;data, languages;query, Logic, object, optimization;structure, plans;residue, processing;software, query, query;access, query;integrity, relations;equivalent, representation;ODL, schema;ODMG-93, standard;OQL, standards;, structures;object-oriented, Support, technique;semantic},
	doi = {10.1109/ICDE.1997.581983},
	author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa}
}
@conference {16201,
	title = {Query previews in networked information systems},
	booktitle = {Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96., Proceedings of the Third Forum on},
	year = {1996},
	month = {1996/05//},
	pages = {120 - 129},
	abstract = {In a networked information system (such as the NASA Earth Observing System-Data Information System (EOS-DIS)), there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two phase approach to query formulation. The two phases are the Query Preview and the Query Refinement. In the Query Preview phase, users formulate an initial query by selecting rough attribute values. The estimated number of matching data sets is shown, graphically on preview bars which allows users to rapidly focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero hit queries. When the estimated number of data sets is long enough, the initial query is submitted to the network which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity, problems. This approach is especially appropriate for users who do not have extensive knowledge about the data and who prefer an exploratory method to discover data patterns and exceptions. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment},
	keywords = {attribute, complexity;data, data, Earth, environment;networked, EOS-DIS;NASA, formulation;querying, formulation;user, hit, information, interfaces;, interfaces;exploratory, method;matching, networks;information, Observing, patterns;data, performance;networked, Preview;Query, process;rough, queries;computer, query, refinement;data, retrieval;information, services;interactive, sets;network, System-Data, System;Query, systems;query, user, values;zero, volume;dynamic},
	doi = {10.1109/ADL.1996.502522},
	author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben}
}
