Results 1 - 10 of 82,090
Querying Graphs with Uncertain Predicates
by Hao Zhou, Anna A. Shaverdian, George Michailidis, H. V. Jagadish
"... In many applications the available data give rise to an attributed graph, with the nodes corresponding to the entities of interest, edges to their relationships and attributes on both provide additional characteristics. To mine such data structures we have proposed a visual analytic algebra that enh ..."
of such uncertain queries. To address this issue, we introduce a probabilistic framework that incorporates uncertainty in the queries and provides a probabilistic assessment of the likelihood of the obtained outcomes. We discuss its technical characteristics and illustrate it on a number of examples.
Querying object-oriented databases
by Michael Kifer, Won Kim, Yehoshua Sagiv - ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1992
"... We present a novel language for querying object-oriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the first-order formalization of object-oriented languages from [KW89, KLW90, KW92]. The language inco ..."
We present a novel language for querying object-oriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the first-order formalization of object-oriented languages from [KW89, KLW90, KW92]. The language
The Lorel Query Language for Semistructured Data
by Serge Abiteboul, Dallan Quass, Jason Mchugh, Jennifer Widom, Janet Wiener - International Journal on Digital Libraries , 1997
"... We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages are inapprop ..."
We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages
A Framework for Dynamic Graph Drawing
by Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - CONGRESSUS NUMERANTIUM , 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, series-parallel digraphs, planar st-digraphs, and planar
Tinydb: An acquisitional query processing system for sensor networks
by Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong - ACM Trans. Database Syst , 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs
Efficient Query Evaluation on Probabilistic Databases
by Nilesh Dalvi, Dan Suciu , 2004
"... We describe a system that supports arbitrarily complex SQL queries with "uncertain" predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Retrieval. Our main focus is efficient query evaluation, a problem that has not received attentio ..."
We describe a system that supports arbitrarily complex SQL queries with "uncertain" predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Retrieval. Our main focus is efficient query evaluation, a problem that has not received
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
by Jeen Broekstra, Arjohn Kampman, Frank Van Harmelen , 2002
"... RDF and RDF Schema are two W3C standards aimed at enriching the Web with machine-processable semantic data. ..."
RDF and RDF Schema are two W3C standards aimed at enriching the Web with machine-processable semantic data.
Logical foundations of object-oriented and frame-based languages
by Michael Kifer, Georg Lausen, James Wu - JOURNAL OF THE ACM , 1995
"... We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
by Leonidas Guibas, Jorge Stolfi - ACM Tmns. Graph , 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Models and issues in data stream systems
by Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, Jennifer Widom - IN PODS , 2002
"... In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams. In addition to reviewing past work releva ..."
relevant to data stream systems and current projects in the area, the paper explores topics in stream query languages, new requirements and challenges in query processing, and algorithmic issues.