@article {19253,
	title = {Design and Synthesis for Multimedia Systems Using the Targeted Dataflow Interchange Format},
	journal = {IEEE Transactions on Multimedia},
	volume = {14},
	year = {2012},
	month = {2012},
	pages = {630 - 640},
	abstract = {Development of multimedia systems that can be targeted to different platforms is challenging due to the need for rigorous integration between high-level abstract modeling, and low-level synthesis and optimization. In this paper, a new dataflow-based design tool called the targeted dataflow interchange format is introduced for retargetable design, analysis, and implementation of embedded software for multimedia systems. Our approach provides novel capabilities, based on principles of task-level dataflow analysis, for exploring and optimizing interactions across design components; object-oriented data structures for encapsulating contextual information for components; a novel model for representing parameterized schedules that are derived from repetitive graph structures; and automated code generation for programming interfaces and low-level customizations that are geared toward high-performance embedded-processing architectures. We demonstrate our design tool for cross-platform application design, parameterized schedule representation, and associated dataflow graph-code generation using a case study centered around an image registration application.},
	keywords = {associated dataflow graph-code generation, Computational modeling, contextual information encapsulation, cross-platform application design, data flow graphs, Data models, Data structures, Dataflow graphs, design components, design tools, Digital signal processing, electronic data interchange, embedded signal processing, Embedded software, high-level abstract modeling, high-performance embedded-processing architectures, Image coding, image registration application, image representation, low-level customizations, low-level optimization, low-level synthesis, Multimedia communication, multimedia systems, multimedia systems development, object-oriented data structures, object-oriented methods, parameterized schedule representation, programming interfaces, repetitive graph structures, retargetable design, Schedules, scheduling, software synthesis, Streaming media, targeted dataflow interchange format, task-level dataflow analysis},
	isbn = {1520-9210},
	author = {Chung-Ching Shen and Wu, Shenpei and Sane, N. and Wu, Hsiang-Huang and Plishker,W. and Bhattacharyya, Shuvra S.}
}
@inbook {19628,
	title = {A Canonical Form for Testing Boolean Function Properties},
	booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
	series = {Lecture Notes in Computer Science},
	year = {2011},
	month = {2011/01/01/},
	pages = {460 - 471},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a {\textquotedblleft}canonical{\textquotedblright} tester in which a set of vertices is selected at random and the edges queried are the complete graph over the selected vertices. We define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form. Our first main result shows, roughly speaking, that every {\textquotedblleft}nice{\textquotedblright} family of Boolean functions that has low noise sensitivity and is testable by an {\textquotedblleft}independent tester,{\textquotedblright} has a canonical testing algorithm. Our second main result is similar but holds instead for families of Boolean functions that are closed under ID-negative minors. Taken together, these two results cover almost all of the constant-query Boolean function testing algorithms that we know of in the literature, and show that all of these testing algorithms can be automatically converted into a canonical form.},
	keywords = {Algorithm Analysis and Problem Complexity, Boolean functions, Computation by Abstract Devices, Computer Communication Networks, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, property testing},
	isbn = {978-3-642-22934-3, 978-3-642-22935-0},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-22935-0_39},
	author = {Dana Dachman-Soled and Servedio, Rocco A.},
	editor = {Goldberg, Leslie Ann and Jansen, Klaus and Ravi, R. and Rolim, Jos{\'e} D. P.}
}
@inbook {19605,
	title = {Graph Drawing for Security Visualization},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2009},
	month = {2009/01/01/},
	pages = {2 - 13},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {With the number of devices connected to the internet growing rapidly and software systems being increasingly deployed on the web, security and privacy have become crucial properties for networks and applications. Due the complexity and subtlety of cryptographic methods and protocols, software architects and developers often fail to incorporate security principles in their designs and implementations. Also, most users have minimal understanding of security threats. While several tools for developers, system administrators and security analysts are available, these tools typically provide information in the form of textual logs or tables, which are cumbersome to analyze. Thus, in recent years, the field of security visualization has emerged to provide novel ways to display security-related information so that it is easier to understand. In this work, we give a preliminary survey of approaches to the visualization of computer security concepts that use graph drawing techniques.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-642-00218-2, 978-3-642-00219-9},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-00219-9_2},
	author = {Tamassia, Roberto and Palazzi, Bernardo and Charalampos Papamanthou},
	editor = {Tollis, Ioannis G. and Patrignani, Maurizio}
}
@inbook {19602,
	title = {Algorithms for Location Estimation Based on RSSI Sampling},
	booktitle = {Algorithmic Aspects of Wireless Sensor Networks},
	series = {Lecture Notes in Computer Science},
	year = {2008},
	month = {2008/01/01/},
	pages = {72 - 86},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {In this paper, we re-examine the RSSI measurement model for location estimation and provide the first detailed formulation of the probability distribution of the position of a sensor node. We also show how to use this probabilistic model to efficiently compute a good estimation of the position of the sensor node by sampling multiple readings from the beacons (where we do not merely use the mean of the samples) and then minimizing a function with an acceptable computational effort. The results of the simulation of our method in TOSSIM indicate that the location of the sensor node can be computed in a small amount of time and that the quality of the solution is competitive with previous approaches.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data structures, Discrete Mathematics in Computer Science, Information Systems and Communication Service},
	isbn = {978-3-540-92861-4, 978-3-540-92862-1},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-92862-1_7},
	author = {Charalampos Papamanthou and Preparata, Franco P. and Tamassia, Roberto},
	editor = {Fekete, S{\'a}ndor P.}
}
@inbook {19642,
	title = {Optimal Cryptographic Hardness of Learning Monotone Functions},
	booktitle = {Automata, Languages and Programming},
	series = {Lecture Notes in Computer Science},
	year = {2008},
	month = {2008/01/01/},
	pages = {36 - 47},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {A wide range of positive and negative results have been established for learning different classes of Boolean functions from uniformly distributed random examples. However, polynomial-time algorithms have thus far been obtained almost exclusively for various classes of monotone functions, while the computational hardness results obtained to date have all been for various classes of general (nonmonotone) functions. Motivated by this disparity between known positive results (for monotone functions) and negative results (for nonmonotone functions), we establish strong computational limitations on the efficient learnability of various classes of monotone functions. We give several such hardness results which are provably almost optimal since they nearly match known positive results. Some of our results show cryptographic hardness of learning polynomial-size monotone circuits to accuracy only slightly greater than 1/2+1/n--√1/2 + 1/\sqrt{n} ; this accuracy bound is close to optimal by known positive results (Blum et al., FOCS {\textquoteright}98). Other results show that under a plausible cryptographic hardness assumption, a class of constant-depth, sub-polynomial-size circuits computing monotone functions is hard to learn; this result is close to optimal in terms of the circuit size parameter by known positive results as well (Servedio, Information and Computation {\textquoteright}04). Our main tool is a complexity-theoretic approach to hardness amplification via noise sensitivity of monotone functions that was pioneered by O{\textquoteright}Donnell (JCSS {\textquoteright}04).},
	keywords = {Data structures, Data Structures, Cryptology and Information Theory, Discrete Mathematics in Computer Science, Numeric Computing, Software Engineering/Programming and Operating Systems, Theory of computation},
	isbn = {978-3-540-70574-1, 978-3-540-70575-8},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-70575-8_4},
	author = {Dana Dachman-Soled and Lee, Homin K. and Malkin, Tal and Servedio, Rocco A. and Wan, Andrew and Wee, Hoeteck},
	editor = {Aceto, Luca and Damg{\r a}rd, Ivan and Goldberg, Leslie Ann and Halld{\'o}rsson, Magn{\'u}s M. and Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor}
}
@conference {15573,
	title = {Tradeoffs in Approximate Range Searching Made Simpler},
	booktitle = {Computer Graphics and Image Processing, 2008. SIBGRAPI {\textquoteright}08. XXI Brazilian Symposium on},
	year = {2008},
	month = {2008/10//},
	pages = {237 - 244},
	abstract = {Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in R^d into a data structure, so that it is possible to determine the subset of points lying within a given query range. In approximate range searching, a parameter eps epsiv gt; 0 is given, and for a given query range R the points lying within distance eps diam(R) of the range{\textquoteright}s boundary may be counted or not. In this paper we present three results related to the issue of tradeoffs in approximate range searching. First, we introduce the range sketching problem. Next, we present a space-time tradeoff for smooth convex ranges, which generalize spherical ranges. Finally, we show how to modify the previous data structure to obtain a space-time tradeoff for simplex ranges. In contrast to existing results, which are based on relatively complex data structures, all three of our results are based on simple, practical data structures.},
	keywords = {approximate range searching, computational geometry, data structure, Data structures, query range},
	doi = {10.1109/SIBGRAPI.2008.24},
	author = {Arya,S. and Fonseca,G. and Mount, Dave}
}
@inbook {19606,
	title = {On the Cost of Persistence and Authentication in Skip Lists},
	booktitle = {Experimental Algorithms},
	series = {Lecture Notes in Computer Science},
	year = {2007},
	month = {2007/01/01/},
	pages = {94 - 107},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.},
	keywords = {Algorithm Analysis and Problem Complexity, algorithms, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, Numeric Computing},
	isbn = {978-3-540-72844-3, 978-3-540-72845-0},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-72845-0_8},
	author = {Goodrich, Michael T. and Charalampos Papamanthou and Tamassia, Roberto},
	editor = {Demetrescu, Camil}
}
@article {16850,
	title = {Execution time analysis of a top-down R-tree construction algorithm},
	journal = {Information Processing Letters},
	volume = {101},
	year = {2007},
	month = {2007/01/16/},
	pages = {6 - 12},
	abstract = {A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to Garc{\'\i}a et al. [Y.J. Garc{\'\i}a, M.A. L{\'o}pez, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS{\textquoteright}98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163{\textendash}164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.},
	keywords = {Bulk loading, Data structures, Packing, R-trees, Spatial databases},
	isbn = {0020-0190},
	doi = {10.1016/j.ipl.2006.07.010},
	url = {http://www.sciencedirect.com/science/article/pii/S002001900600233X},
	author = {Alborzi,Houman and Samet, Hanan}
}
@inbook {19623,
	title = {Parameterized st-Orientations of Graphs: Algorithms and Experiments},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2007},
	month = {2007/01/01/},
	pages = {220 - 233},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. However, as indicated in [1], the computation of more than one st-orientation is very important for many applications in multiple research areas, such as this of Graph Drawing. In this paper we show how to compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the length of the longest path. Apart from Graph Drawing, this work applies in other areas such as Network Routing and in tackling difficult problems such as Graph Coloring and Longest Path. We present primary approaches to the problem of computing longest path parameterized st-orientations of graphs, an analytical presentation (together with proof of correctness) of a new O(mlog5 n) (O(mlogn) for planar graphs) time algorithm that computes such orientations (and which was used in [1]) and extensive computational results that reveal the robustness of the algorithm.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-70903-9, 978-3-540-70904-6},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-70904-6_22},
	author = {Charalampos Papamanthou and Tollis, Ioannis G.},
	editor = {Kaufmann, Michael and Wagner, Dorothea}
}
@inbook {19624,
	title = {Applications of Parameterized st-Orientations in Graph Drawing Algorithms},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2006},
	month = {2006/01/01/},
	pages = {355 - 367},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-31425-7, 978-3-540-31667-1},
	url = {http://link.springer.com/chapter/10.1007/11618058_32},
	author = {Charalampos Papamanthou and Tollis, Ioannis G.},
	editor = {Healy, Patrick and Nikolov, Nikola S.}
}
@inbook {19610,
	title = {3D Visualization of Semantic Metadata Models and Ontologies},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2005},
	month = {2005/01/01/},
	pages = {377 - 388},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We propose an algorithm for the 3D visualization of general ontology models used in many applications, such as semantic web, entity-relationship diagrams and other database models. The visualization places entities in the 3D space. Previous techniques produce drawings that are 2-dimensional, which are often complicated and hard to comprehend. Our technique uses the third dimension almost exclusively for the display of the isa relationships (links) while the property relationships (links) are placed on some layer (plane). Thus the semantic difference between isa links and property links, which should be as vertical or as horizontal as possible respectively, is emphasized. Special reference is made on a certain model, the CIDOC Conceptual Reference Model.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-24528-5, 978-3-540-31843-9},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-31843-9_38},
	author = {Charalampos Papamanthou and Tollis, Ioannis G. and Doerr, Martin},
	editor = {Pach, J{\'a}nos}
}
@article {14932,
	title = {A new framework for addressing temporal range queries and some preliminary results},
	journal = {Theoretical Computer Science},
	volume = {332},
	year = {2005},
	month = {2005/02/28/},
	pages = {109 - 121},
	abstract = {Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing space efficient indexing structures such that a class of temporal range search queries can be handled efficiently. When m = 1 , our problem reduces to the d-dimensional orthogonal search problem. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O ( log n log m + f ) for one-sided queries when d = 1 , where f is the number of objects satisfying the query. A similar result is shown for counting queries. We also show that the most general problem can be solved with a polylogarithmic query time using superlinear space data structures.},
	keywords = {algorithms, Data structures, Orthogonal range search, temporal data},
	isbn = {0304-3975},
	doi = {10.1016/j.tcs.2004.10.013},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397504007005},
	author = {Shi,Qingmin and JaJa, Joseph F.}
}
@article {13267,
	title = {A multi-resolution topological representation for non-manifold meshes},
	journal = {Computer-Aided Design},
	volume = {36},
	year = {2004},
	month = {2004/02//},
	pages = {141 - 159},
	abstract = {We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology, at different levels of detail. First, we describe a multi-resolution model, that we call a non-manifold multi-tessellation (NMT), and we consider the selective refinement query, which is at the heart of several analysis operations on multi-resolution meshes. Next, we focus on a specific instance of a NMT, generated by simplifying simplicial meshes based on vertex-pair contraction, and we describe a compact data structure for encoding such a model. We also propose a new data structure for two-dimensional simplicial meshes, capable of representing both connectivity and adjacency information with a small memory overhead, which is used to describe the mesh extracted from an NMT through selective refinement. Finally, we present algorithms to efficiently perform updates on such a data structure.},
	keywords = {Data structures, Multi-resolution, Non-manifold modeling},
	isbn = {0010-4485},
	doi = {10.1016/S0010-4485(03)00058-7},
	url = {http://www.sciencedirect.com/science/article/pii/S0010448503000587},
	author = {De Floriani, Leila and Magillo,Paola and Puppo,Enrico and Sobrero,Davide}
}
@article {15594,
	title = {A Fast Implementation of the ISOCLUS Algorithm},
	journal = {IEEE 2003 International Geoscience and Remote Sensing Symposium},
	year = {2003},
	month = {2003///},
	abstract = {Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.},
	keywords = {algorithms, Cluster Analysis, Data structures, HEURISTIC METHODS, IMAGE PROCESSING, INTEGERS, LANDSAT SATELLITES, MEAN SQUARE VALUES, Remote sensing},
	url = {http://ntrs.nasa.gov/search.jsp?R=20030053175},
	author = {Memarsadeghi,Nargess and Mount, Dave and Netanyahu,Nathan S. and LeMoigne,Jacqueline}
}
@conference {13322,
	title = {Representation of non-manifold objects},
	booktitle = {Proceedings of the eighth ACM symposium on Solid modeling and applications},
	series = {SM {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {304 - 309},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In our previous work [2], we have shown that a non-manifold, mixed-dimensional object described by simplicial complexes can be decomposed in a unique way into regular components, all belonging to a well-understood class. Based on such decomposition, we define here a two-level topological data structure for representing non-manifold objects in any dimension: the first level represents components; while the second level represents the connectivity relation among them. The resulting data structure is compact and scalable, allowing for the efficient treatment of singularities without burdening well-behaved parts of a complex with excessive space overheads.},
	keywords = {Data structures, Non-manifold modeling, simplicial complexes},
	isbn = {1-58113-706-0},
	doi = {10.1145/781606.781656},
	url = {http://doi.acm.org/10.1145/781606.781656},
	author = {De Floriani, Leila and Morando,Franco and Puppo,Enrico}
}
@conference {13343,
	title = {Using state modules for adaptive query processing},
	booktitle = {19th International Conference on Data Engineering, 2003. Proceedings},
	year = {2003},
	month = {2003/03/05/8},
	pages = {353 - 364},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed adaptively by an eddy routing operator [R. Avnur et al., (2000)]. Breaking the encapsulation of joins serves two purposes. First, it allows the eddy to observe multiple physical operations embedded in a join algorithm, allowing for better calibration and control of these operations. Second, the SteM on a relation serves as a shared materialization point, enabling multiple competing access methods to share results, which can be leveraged by multiple competing join algorithms. Our architecture extends prior work significantly, allowing continuously adaptive decisions for most major aspects of traditional query optimization: choice of access methods and join algorithms, ordering of operators, and choice of a query spanning tree. SteMs introduce significant routing flexibility to the eddy, enabling more opportunities for adaptation, but also introducing the possibility of incorrect query results. We present constraints on eddy routing through SteMs that ensure correctness while preserving a great deal of flexibility. We also demonstrate the benefits of our architecture via experiments in the Telegraph dataflow system. We show that even a simple routing policy allows significant flexibility in adaptation, including novel effects like automatic "hybridization " of multiple algorithms for a single join.},
	keywords = {adaptive query processing, Bandwidth, Calibration, data encapsulation, data structure, Data structures, Databases, Dictionaries, eddy routing, eddy routing operator, Encapsulation, join operator, multiple algorithm automatic hybridization, multiple competing join algorithm, query architecture, Query processing, query spanning tree, Routing, routing policy, Runtime, shared materialization point, State Module, SteMs, Telegraph dataflow system, Telegraphy, Tree data structures},
	isbn = {0-7803-7665-X},
	doi = {10.1109/ICDE.2003.1260805},
	author = {Vijayshankar Raman and Deshpande, Amol and Hellerstein,J. M}
}
@conference {17835,
	title = {Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs},
	booktitle = {2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2002},
	year = {2002},
	month = {2002/05/21/24},
	pages = {154 - 154},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific datasets. Queries in these applications involve user-defined processing operations and distributed data structures to hold intermediate and final results. Our goal is to implement system components to leverage previously computed query results and to effectively utilize processing power and aggregated I/O bandwidth on SMP nodes so that both single queries and multi-query batches can be efficiently executed.},
	keywords = {Aggregates, Application software, Bandwidth, Data analysis, Data structures, Delay, Query processing, scheduling, Subcontracting, Switched-mode power supply},
	isbn = {0-7695-1582-7},
	doi = {10.1109/CCGRID.2002.1017123},
	author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@article {12089,
	title = {Secure quality of service handling: SQoSH},
	journal = {IEEE Communications Magazine},
	volume = {38},
	year = {2000},
	month = {2000/04//},
	pages = {106 - 112},
	abstract = {Proposals for programmable network infrastructures, such as active networks and open signaling, provide programmers with access to network resources and data structures. The motivation for providing these interfaces is accelerated introduction of new services, but exposure of the interfaces introduces many new security risks. We describe some of the security issues raised by active networks. We then describe our secure active network environment (SANE) architecture. SANE was designed as a security infrastructure for active networks, and was implemented in the SwitchWare architecture. SANE restricts the actions that loaded modules can perform by restricting the resources that can be named; this is further extended to remote invocation by means of cryptographic credentials. SANE can be extended to support restricted control of quality of service in a programmable network element. The Piglet lightweight device kernel provides a {\textquotedblleft}virtual clock{\textquotedblright} type of scheduling discipline for network traffic, and exports several tuning knobs with which the clock can be adjusted. The ALIEN active loader provides safe access to these knobs to modules that operate on the network element. Thus, the proposed SQoSH architecture is able to provide safe, secure access to network resources, while allowing these resources to be managed by end users needing customized networking services. A desirable consequence of SQoSH{\textquoteright}s integration of access control and resource control is that a large class of denial-of-service attacks, unaddressed solely with access control and cryptographic protocols, can now be prevented},
	keywords = {Acceleration, Access control, active networks, ALIEN active loader, Clocks, Computer network management, cryptographic credentials, cryptography, customized networking services, Data security, Data structures, denial-of-service attacks, interfaces, Kernel, loaded modules, network resources, network traffic, open signaling, packet switching, Piglet lightweight device kernel, programmable network element, programmable network infrastructures, Programming profession, Proposals, quality of service, remote invocation, resource control, restricted control of quality of service, SANE, scheduling, scheduling discipline, secure active network environment architecture, secure quality of service handling, security infrastructure, security risks, SQoSH, SwitchWare architecture, telecommunication security, tuning knobs, virtual clock},
	isbn = {0163-6804},
	doi = {10.1109/35.833566},
	author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Muir,S. and Smith,J. M}
}
@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 {12799,
	title = {Efficient model checking via the equational μ-calculus},
	booktitle = {, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS {\textquoteright}96. Proceedings},
	year = {1996},
	month = {1996/07/27/30},
	pages = {304 - 312},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper studies the use of an equational variant of the modal μ-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the μ-calculus. Using this translation, one may then employ μ-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*},
	keywords = {Automata, BDD-based algorithms, Boolean functions, Calculus, compositional model-checking approaches, computational complexity, Computer science, CTL*, Data structures, Encoding, equational variant, equational μ-calculus, Equations, expressive temporal logic, Logic, Maintenance, modal μ-calculus, Model checking, on-the-fly procedures, Surges, temporal logic, temporal logic model checking, unified framework},
	isbn = {0-8186-7463-6},
	doi = {10.1109/LICS.1996.561358},
	author = {Bhat,G. and Cleaveland, Rance}
}
@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.}
}
@article {16737,
	title = {The Logical Access Path Schema of a Database},
	journal = {IEEE Transactions on Software Engineering},
	volume = {SE-8},
	year = {1982},
	month = {1982/11//},
	pages = {563 - 573},
	abstract = {A new schema which models the usage of the logical access paths of the database is proposed. The schema models all database activities (i.e., retrievals and updates), and integrates their logical access paths by recognizing common subpaths and increasing the "weight" of the shared subpaths. The logical access path schema provides a comprehensive picture of the logical access paths, and the cumulative usage of the shared subpaths and/or intermediate results. The schema serves a dual purpose. Firstly, it is used as a model of the access requirements during the database design, and secondly, as the basis for optimization during the operation of the database.},
	keywords = {Aggregation hierarchy, Calculus, Computer science, Data structures, Databases, Design optimization, external logical subschema, generalization hierarchy, Information retrieval, Joining processes, logical access path, propositional calculus, views},
	isbn = {0098-5589},
	doi = {10.1109/TSE.1982.235886},
	author = {Roussopoulos, Nick}
}
@conference {17051,
	title = {Database Program Conversion: A Framework For Research},
	booktitle = {Fifth International Conference on Very Large Data Bases, 1979},
	year = {1979},
	month = {1979/10/03/5},
	pages = {299 - 312},
	publisher = {IEEE},
	organization = {IEEE},
	keywords = {Application software, Costs, Data conversion, Data structures, Databases, Delay, Prototypes, Technology planning, US Government, Writing},
	doi = {10.1109/VLDB.1979.718145},
	author = {Taylor,R. W and Fry,J. P and Shneiderman, Ben and Smith,D. C.P and Su,S. Y.W}
}
@article {16984,
	title = {Batched searching of sequential and tree structured files},
	journal = {ACM Trans. Database Syst.},
	volume = {1},
	year = {1976},
	month = {1976/09//},
	pages = {268 - 275},
	abstract = {The technique of batching searches has been ignored in the context of disk based online data retrieval systems. This paper suggests that batching be reconsidered for such systems since the potential reduction in processor demand may actually reduce response time. An analysis with sample numerical results and algorithms is presented.},
	keywords = {<italic>B</italic>-trees, batched searching, Data structures, Database systems, file management, Indexes, informational retrieval, sequential files, tree structures},
	isbn = {0362-5915},
	doi = {10.1145/320473.320487},
	url = {http://doi.acm.org/10.1145/320473.320487},
	author = {Shneiderman, Ben}
}
@article {17383,
	title = {Structured data structures},
	journal = {Communications of the ACM},
	volume = {17},
	year = {1974},
	month = {1974/10//},
	pages = {566 - 574},
	abstract = {Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly. To remedy this situation, this paper proposes a Data Structure Description and Manipulation Language which provides for the creation of a restricted class of data structures but ensures the correctness of the program. This is accomplished by an explicit structure declaration facility, a restriction on the permissible operations, and execution-time checks.},
	keywords = {data base management system, Data structures, structured programming},
	isbn = {0001-0782},
	doi = {10.1145/355620.361170},
	url = {http://doi.acm.org/10.1145/355620.361170},
	author = {Shneiderman, Ben and Scheuermann,Peter}
}
