• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,694
Next 10 →

Query Deforestation

by Torsten Grust, Marc H. Scholl , 1998
"... The construction of a declarative query interface for a DBMS includes ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
The construction of a declarative query interface for a DBMS includes

DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

by Roy Goldman, Jennifer Widom , 1997
"... In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural summaries of semistructured databases. DataGuides serve as dynamic schemas, generated from the database; they are ..."
Abstract - Cited by 572 (13 self) - Add to MetaCart
. We provide performance results based on our implementation of DataGuides in the Lore DBMS for semistructured data. We also describe the use of DataGuides in Lore, both in the user interface to enable structure browsing and query formulation, and as a means of guiding the query processor

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, ..."
Abstract - Cited by 876 (65 self) - Add to MetaCart
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

The click modular router

by Eddie Kohler , 2001
"... Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devic ..."
Abstract - Cited by 1167 (28 self) - Add to MetaCart
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network

SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture LIbraries

by James Z. Wang, Jia Li, Gio Wiederhold - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... The need for efficient content-based image retrieval has increased tremendously in many application areas such as biomedicine, military, commerce, education, and Web image classification and searching. We present here SIMPLIcity (Semanticssensitive Integrated Matching for Picture LIbraries), an imag ..."
Abstract - Cited by 551 (35 self) - Add to MetaCart
of inaccurate segmentation, 2) helps to clarify the semantics of a particular region, and 3) enables a simple querying interface for region-based image retrieval systems. The application of SIMPLIcity to several databases, including a database of about 200,000 general-purpose images, has demonstrated that our

Constraint Query Languages

by Paris C. Kanellakis , Gabriel M. Kuper, Peter Z. Revesz , 1992
"... We investigate the relationship between programming with constraints and database query languages. We show that efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction ..."
Abstract - Cited by 372 (43 self) - Add to MetaCart
We investigate the relationship between programming with constraints and database query languages. We show that efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction

Model-Driven Data Acquisition in Sensor Networks

by Amol Deshpande , Carlos Guestrin, Samuel R. Madden, et al. - IN VLDB , 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract - Cited by 449 (36 self) - Add to MetaCart
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor

The design of Postgres

by Michael Stonebraker, Lawrence A. Rowe - In Proceedings of the SIGMOD Conference , 1986
"... This paper presents the preliminary design of a new database management system, called POSTGRES, that is the successor to the INGRES relational database system. The main design goals of the new system are to: 1) provide better support for complex objects, 2) provide user extendibility for data types ..."
Abstract - Cited by 431 (23 self) - Add to MetaCart
of multiple tightly-coupled processors, and custom designed VLSI chips, and 6) make as few changes as possible (preferably none) to the relational model. The paper describes the query language, programming langauge interface, system architecture, query processing strategy, and storage system for the new

The CQL Continuous Query Language: Semantic Foundations and Query Execution

by Arvind Arasu, Shivnath Babu, Jennifer Widom - VLDB Journal , 2003
"... CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics that relie ..."
Abstract - Cited by 354 (4 self) - Add to MetaCart
CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics

A Query Language for XML

by Alin Deutsch, Mary Fernandez, Daniela Florescu, Alon Levy, Dan Suciu , 1998
"... An important application of XML is the interchange of electronic data (EDI) between multiple data sources on the Web. As XML data proliferates on the Web, applications will need to integrate and aggregate data from multiple source and clean and transform data to facilitate exchange. Data extraction, ..."
Abstract - Cited by 340 (22 self) - Add to MetaCart
, conversion, transformation, and integration are all well-understood database problems, and their solutions rely on a query language. We present a query language for XML, called XML-QL, which we argue is suitable for performing the above tasks. XML-QL is a declarative, "relational complete" query
Next 10 →
Results 1 - 10 of 7,694
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University