National Library of Energy BETA

Sample records for queries sparql queries

  1. REGULAR PATHS IN SPARQL: QUERYING THE NCI THESAURUS

    E-Print Network [OSTI]

    Washington at Seattle, University of

    REGULAR PATHS IN SPARQL: QUERYING THE NCI THESAURUS University of Washington Structural Informatics path enhancements Examples NCI Thesaurus Widely used Exhibits common OWL representational patterns

  2. SPARQL Query Form | OpenEI

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page onRAPID/Geothermal/Exploration/ColoradoRemsenburg-Speonk, NewMichigan:Roxbury,RushS.KSPARQL Query Form Default Graph URI

  3. Regular Paths in SparQL: Querying the NCI Thesaurus Landon T. Detwiler1

    E-Print Network [OSTI]

    Washington at Seattle, University of

    Regular Paths in SparQL: Querying the NCI Thesaurus Landon T. Detwiler1 , Dan Suciu, PhD3 , James F can create views of the OWL version of the NCI Thesaurus that match the views generated by the web the matched triples. Some examples of triples from the National Cancer Institute (NCI) Thesaurus that would

  4. Spatial Keyword Query (SKQ)

    E-Print Network [OSTI]

    Papadias, Dimitris

    S contains keywords {"Starbucks", "Boardway", "Cinema"} 3 #12;Types of Query Single object oriented SKQ o", "Starbucks"} Result = {o7, o9 } 10 #12;m Closest Keywords Query (mCK Query) Query input o a set of keywords., ICDE'09 Example Input: q. = {"Cinema", "Starbucks"} Result = {o7, o9 } 11 #12;localitySearch Query

  5. Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives

    E-Print Network [OSTI]

    Chen, Brian Y.

    Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives Kostas E query planners. Our implementation uses a probabilistic roadmap method (PRM) with bidirec- tional the strengths of both is obtained. The probabilistic roadmap method (PRM) approach to motion planning

  6. Query Optimization Techniques Class Hierarchies

    E-Print Network [OSTI]

    Mannheim, Universität

    Query Optimization Techniques Exploiting Class Hierarchies Sophie Cluet 1 Guido Moerkotte 2 1 INRIA Since the introduction of object base management systems (OBMS), many query optimization techniques tailored for object query languages have been proposed. They adapt known optimization techniques

  7. A Query Simulation System To Illustrate Database Query Execution

    E-Print Network [OSTI]

    Wagner, Paul J.

    the steps a DBMS performs during query execution. Database students need to be familiar with the underlying query execution process in order to understand how the DBMS implements commits and rollbacks. The query execution process also impacts query optimization techniques, and provides the foundation for how the DBMS

  8. Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives

    E-Print Network [OSTI]

    Kavraki, Lydia E.

    Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives Kostas E query planners. Our implementation uses a probabilistic roadmap method PRM with bidirectional rapidly which uses the strengths of both is obtained. The probabilistic roadmap method (PRM) approach to motion

  9. Reflections for quantum query algorithms

    E-Print Network [OSTI]

    Ben W. Reichardt

    2010-05-10

    We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.

  10. Query | Department of Energy

    Broader source: Energy.gov (indexed) [DOE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergy AEnergyPresidentialThis 3-D rendering of apumpthe firstEnergyQuery

  11. Continuous Query Processing in Data Streams Using Duality of Data and Queries

    E-Print Network [OSTI]

    Song, Il-Yeol

    Continuous Query Processing in Data Streams Using Duality of Data and Queries Hyo-Sang Lim, Jae and query-initiative methods only for ad-hoc queries. We contend that continuous query processing can. In this paper, we first present a new viewpoint of transforming the continuous query processing problem

  12. Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets

    E-Print Network [OSTI]

    Toronto, University of

    .g., query responses or behavioral observations). The most natural criterion for choosing queries is expected

  13. Top-N Query: Query Language, Distance Function and Processing Strategies

    E-Print Network [OSTI]

    Meng, Weiyi

    Top-N Query: Query Language, Distance Function and Processing Strategies Yuxi Chen, Weiyi Meng@cs.binghamton.edu Abstract. The top-N query problem is to find the N results that satisfy the query condition the best and products are sold on the Internet. This paper addresses three important issues related to the top-N query

  14. Failure Analysis in Query Construction: Data and Analysis from A Large Sample of Web Queries

    E-Print Network [OSTI]

    Saracevic, Tefko

    are on its Web site. Excite searchesare basedon the exact terms that a user enters in the query, however query construction) of 51,473 queries from 18,113 users of Excite, a major Web search engine. Given of the traditional search engine interfaces. KEYWORDS: Web queries, query construction INTRODUCTION Many digital

  15. RankSQL: Query Algebra and Optimization for Relational Top-k Queries

    E-Print Network [OSTI]

    Ilyas, Ihab Francis

    RankSQL: Query Algebra and Optimization for Relational Top-k Queries Chengkai Li1 Kevin Chen systems (RDBMS), by extending relational algebra and query optimization. Previously, top-k query and principled framework to support efficient evaluations of ranking (top-k) queries in relational database

  16. Asymmetric Structure-Preserving Subgraph Queries for Large Graphs

    E-Print Network [OSTI]

    Xu, Jianliang

    is subgraph isomorphism queries (a.k.a subgraph queries). Due to the computational hardness of subgraph queries that preserve the query structure (a.k.a topology) over large networks has not yet been studied

  17. Text Queries on Document Time Series

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    Retrieved for Query "iraq war" #12;Smoothed Timeline for "iraq war" #12;Temporal Models Goal: Estimate;Documents Retrieved for Query "iraq war" #12;Weighted by Document Relevance #12;Smoothed with Background

  18. Assisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification

    E-Print Network [OSTI]

    Ng, Yiu-Kai Dennis

    . For example, when the word "Tiger" is entered by a user, current web search engines are mostly focusedAssisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification search engines is query suggestion (QS), which assists users in formulating keyword queries by suggesting

  19. Demand Queries with Preprocessing Uriel Feige

    E-Print Network [OSTI]

    Demand Queries with Preprocessing Uriel Feige and Shlomo Jozeph May 1, 2014 )>IJH=?J Given a set of items and a submodular set-function f that determines the value of every subset of items, a demand query, the value of S minus its price. The use of demand queries is well motivated in the context of com

  20. Scalable Continuous Query Processing by Tracking Hotspots

    E-Print Network [OSTI]

    Yang, Jun

    Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai}@cs.duke.edu ABSTRACT This paper considers the problem of scalably processing a large number of continuous queries. We for intervals in linear time. 1. INTRODUCTION Continuous query processing has attracted much interest

  1. Qunits: queried units in database search

    E-Print Network [OSTI]

    Nandi, Arnab

    2009-01-01

    Keyword search against structured databases has become a popular topic of investigation, since many users find structured queries too hard to express, and enjoy the freedom of a ``Google-like'' query box into which search terms can be entered. Attempts to address this problem face a fundamental dilemma. Database querying is based on the logic of predicate evaluation, with a precisely defined answer set for a given query. On the other hand, in an information retrieval approach, ranked query results have long been accepted as far superior to results based on boolean query evaluation. As a consequence, when keyword queries are attempted against databases, relatively ad-hoc ranking mechanisms are invented (if ranking is used at all), and there is little leverage from the large body of IR literature regarding how to rank query results. Our proposal is to create a clear separation between ranking and database querying. This divides the problem into two parts, and allows us to address these separately. The first tas...

  2. D. Florescu , J. Freire 1SBBD 2000 -Querying the Web Querying the Web

    E-Print Network [OSTI]

    Freire, Juliana

    D. Florescu , J. Freire 1SBBD 2000 - Querying the Web Querying the Web Daniela Florescu INRIA 2000 - Querying the Web The Web - some history x 1989 First Web browser x 1993 Mosaic is released, there are 50 Web sites x 1994 First search engines (WWWW, WebCrawler) x 1996 US$1 billion spent in Internet

  3. Query

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousMathematicsEnergyInterested PartiesBuildingBudget ||

  4. The Query Complexity of Correlated Equilibria

    E-Print Network [OSTI]

    Hart, Sergiu

    The Query Complexity of Correlated Equilibria Sergiu Hart September 2015 SERGIU HART c 2015 ­ p. #12;The Query Complexity of Correlated Equilibria Sergiu Hart Center for the Study of Rationality Dept of Mathematics Dept of Economics The Hebrew University of Jerusalem hart@huji.ac.il http://www.ma.huji.ac.il/hart

  5. Fault Tolerant Evaluation of Continuous Selection Queries over Sensor Data

    E-Print Network [OSTI]

    Lazaridis, Iosif; Han, Qi; Mehrotra, Sharad; Venkatasubramanian, Nalini

    2009-01-01

    Evaluation of Continuous Selection Queries over Sensor Dataevaluation of continuous selection queries (CSQs) over sensor-sensor suffices and there is no Fault Tolerant Evaluation of

  6. T-703: Cisco Unified Communications Manager Open Query Interface...

    Energy Savers [EERE]

    Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents T-703: Cisco Unified Communications Manager Open Query Interface Lets Remote...

  7. PET: Reducing Database Energy Cost via Query Optimization

    E-Print Network [OSTI]

    Tu, Yicheng

    PET: Reducing Database Energy Cost via Query Optimization Zichen Xu The Ohio State University xuz a cost-based query optimizer that eval- uates query plans by both performance and energy costs. By fol can achieve a good understanding of the energy- related query optimization and cost-based plan

  8. Processing Top N and Bottom N Queries Michael J. Carey

    E-Print Network [OSTI]

    Kemper, Alfons

    DBMS, which does not have built-in support for top N and bottom N queries, will end up wasting work.e., one without integrated support for top N and bottom N queries, would end up wasting work. We then show goal is to evaluate such queries with as little wasted work as possible. That is, if a query asks

  9. Expressiveness Issues and Decision Problems for Active Database Event Queries

    E-Print Network [OSTI]

    Mikulas, Szabolcs

    query (specified using the event algebra) over a history of all previously occurring primitive events. 1 will use the terms complex event detection and (complex) event query evaluation over a history synonymously classes of event queries. For example, the histories over which event queries may be evaluated can be very

  10. Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Lee, Wang-Chien

    , to collect metadata from sensor nodes to the query optimizer (i.e. the AP) requires an energy overhead1 Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks Ross Rosemark Wang of energy-efficient query optimization for wireless sensor networks. Different from existing query

  11. Exploring Reductions for Long Web Queries Niranjan Balasubramanian

    E-Print Network [OSTI]

    Murphy, Robert F.

    Exploring Reductions for Long Web Queries Niranjan Balasubramanian University of Massachusetts queries form a difficult, but increasingly important seg- ment for web search engines. Query reduction on TREC collections. Also, it has great potential for improving long web queries (upto 25% improvement

  12. Classifying Web Search Queries to Identify High Revenue Generating Customers

    E-Print Network [OSTI]

    Jansen, James

    searching, the set of terms for which a user searches is called the query. If a user enters a query and then clicks on a result, these query terms are embedded within the URL that is passed from the search engineClassifying Web Search Queries to Identify High Revenue Generating Customers Adan Ortiz-Cordova 329

  13. Privacy-preserving Queries over Relational Databases

    E-Print Network [OSTI]

    Goldberg, Ian

    techniques, such as onion routers and mix networks, offer anonymizing protection for users' identities the query through Tor [12] to preserve the privacy of his or her network address. Nevertheless, the server

  14. Uniform Quantifier Elimination and Constraint Query Processing

    E-Print Network [OSTI]

    2015-08-29

    tics. However, this is not always the case. Consider the. query,. Q= (9T1):R(T1): Clearly, the natural and active domain semantics give dif-. ferent interpretation to

  15. Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    substantially from built- in temporal support in the DBMS. To achieve this, temporal query representation for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well

  16. Failure Analysis in Query Construction: Data and Analysis from A Large Sample of Web Queries

    E-Print Network [OSTI]

    Jansen, James

    ­ more details are on its Web site. Excite searches are based on the exact terms that a user enters in the query, however, capitalization is disregarded. Stemming is not available. Multiple term searches return,473 queries from 18,113 users of Excite, a major Web search engine. Given that many digital libraries

  17. TreeQ-VISTA: An Interactive Tree Visualization Tool with Functional Annotation Query Capabilities

    E-Print Network [OSTI]

    2007-01-01

    for users with or without SQL knowledge. The query resultspowerful and user-friendly SQL query interface that extractsof constructing complex SQL queries that flat file storage

  18. SINA: Scalable Incremental Processing of Continuous Queries in Spatiotemporal Databases

    E-Print Network [OSTI]

    Kaiserslautern, Universität

    SINA: Scalable Incremental Processing of Continuous Queries in Spatiotemporal Databases Mohamed F F. Mokbel, Xiaopeng Xiong, Walid G. Aref ()SINA: Scalable Incremental Processing of Continuous, Xiaopeng Xiong, Walid G. Aref ()SINA: Scalable Incremental Processing of Continuous Queries

  19. Privacy-preserving Queries over Relational Databases Femi Olumofin

    E-Print Network [OSTI]

    Goldberg, Ian

    . While today's most developed and deployed privacy tech- niques, such as onion routers and mix networks' queries. For the front running example, the user could tunnel the query through Tor [17] to preserve

  20. Answering queries using materialized views with minimum size

    E-Print Network [OSTI]

    Chirkova, R; Li, C; Li, J

    2006-01-01

    Mehrotra. Execut- u u s ing SQL over encrypted data in theUrata. Answering complex SQL queries using automatic summaryconsider select-project-join SQL queries and their unions.

  1. Query-based database policy assurance using semantic web technologies

    E-Print Network [OSTI]

    Soltren, José Hiram

    2009-01-01

    In this thesis, we present a novel approach to database security which looks at queries instead of the database tables themselves. In doing so, we use a number of Semantic Web technologies to define rules, translate queries, ...

  2. Query Languages and Tools for XML Documents and Databases

    E-Print Network [OSTI]

    Miller, John A.

    review the evolution of query languages starting in 1974 with SEQUEL and leading to today's SQL3 and OQLv.2 as well as emerging languages based on XML. Figure (1) depicts this evolution of query languages of the the object­oriented DBMS (OODBMS). The current OQL (Object Query Language, v.2) [Cattell et al., 1997] as we

  3. Multi-Objective Query Processing for Data Aggregation

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    data sources all export fragments of a single relation. Given a query, the primary query processing integrate information sources available on the Internet. Data integration systems [13], [21], [22], [28], [31] provide a uniform interface to a multitude of information sources, query the relevant sources

  4. Multi-Objective Query Processing for Data Aggregation

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    data sources all export fragments of a single relation. Given a query, the primary query processing of structured information sources on the web has recently led to significant interest in query processing frameworks that can integrate information sources available on the Internet. Data integration systems [13

  5. Dismantling Complicated Query Attributes with Crowd Matan Laadan

    E-Print Network [OSTI]

    Milo, Tova

    Dismantling Complicated Query Attributes with Crowd Matan Laadan Tel Aviv University Tel Aviv the crowd to dismantle the query attributes into finer related ones (whose value estimation is easier beneficial not to only disman- tle the query attributes themselves, but rather to continue dismantling newly

  6. Private Database Queries Using Somewhat Homomorphic Craig Gentry

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Private Database Queries Using Somewhat Homomorphic Encryption Dan Boneh Craig Gentry Shai Halevi Frank Wang David J. Wu Abstract In a private database query system, a client issues queries to a database and obtains the results with- out learning anything else about the database and without the server

  7. Querying RDF Data from a Graph Database Perspective

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    }@dcc.uchile.cl Agenda · Motivations, Problem and Proposal · Database Models · Graph Database Models · RDF as data model of data model with inherent graph structure. · Database models and query languages should support its that a query language for RDF should provide. Database Models Data structures Operators and Query Language

  8. Document Representation and Query Expansion Models for Blog Recommendation

    E-Print Network [OSTI]

    Callan, Jamie

    Document Representation and Query Expansion Models for Blog Recommendation Jaime Arguello document representation models and two query expansion models for the task of recommend- ing blogs to a user in response to a query. Blog relevance ranking differs from traditional document ranking in ad

  9. Incorporating Seasonality into Search Suggestions Derived from Intranet Query Logs

    E-Print Network [OSTI]

    Kruschwitz, Udo

    Incorporating Seasonality into Search Suggestions Derived from Intranet Query Logs Stephen Dignum performed on query logs collected for major Web search engines, query log analysis to enhance search search engine can be enhanced by adapting the search system to real users' search behaviour through

  10. A Simple Model for Classifying Web Queries by User Intent

    E-Print Network [OSTI]

    Rosso, Paolo

    València, Spain 3 NLE Lab.- ELiRF, Universitat Politècnica de València, Spain 4 PRHLT, Universitat query classification, User intent, Query analysis 1 Introduction Web Search Engines (WSEs) are the most in an interaction with a Web Search Engine. Query Classification based on user intent is different from traditional

  11. Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments

    E-Print Network [OSTI]

    Lu, Chenyang

    Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments Sangeeta Bhattacharya approach that integrates a roadmap based navigation algorithm with a novel WSN query protocol called Roadmap Query (RQ). RQ enables collection of frequent, up-to- date information about the surrounding

  12. Query Suggestions for Mobile Search: Understanding Usage Patterns

    E-Print Network [OSTI]

    Cortes, Corinna

    Inc 1600 Amphitheatre Parkway, Mountain View, CA shumeet@google.com ABSTRACT Entering search terms that users who were asked to enter queries on a search interface with query suggestions rated their workload heavily on suggestions if they are provided. Users who were asked to enter queries on a search interface

  13. Structured Annotations of Web Queries Nikos Sarkas

    E-Print Network [OSTI]

    California at Berkeley, University of

    nsarkas@cs.toronto.edu Stelios Paparizos Microsoft Research Mountain View, CA, USA steliosp@microsoft.com Panayiotis Tsaparas Microsoft Research Mountain View, CA, USA panats@microsoft.com ABSTRACT Queries asked advantage and that copies bear this notice and the full citation on the first page. To copy otherwise

  14. The Temporal Query Language TQuel Richard Snodgrass

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    gives the complete syntax of the TQuel retrieve statement. 2. QUERY LANGUAGES FOR HISTORI- CAL DATABASES solely by the application pr+ grams; the DBMS interprets dates as values in the basedata types's medical history is particularly important. The model supported by TOD (for Time Oriented Data bank

  15. Incremental Aggregation on Multiple Continuous Queries

    E-Print Network [OSTI]

    Carbonell, Jaime

    atop of a DBMS. The evaluation study shows that our approaches are effective and efficient on typical updated upon data changes without revisiting the entire history of grouping elements; while other-defined ones. The system also supports holistic functions by reaggregating the stream history. Consider a query

  16. Answering Historical Queries in Databases using Relevance

    E-Print Network [OSTI]

    Bertossi, Leopoldo

    consider the problem of answering queries about the evolution of the database along a sequence Reiter's proposal [14, 16] to specify the database evolution in the situation calculus, a first.e. in the whole evolution of the database, that a given property holds''? or ``Has a given property been true

  17. Representing and Querying Data Transformations Yannis Velegrakis

    E-Print Network [OSTI]

    Velegrakis, Yannis

    - known sources such as government organizations, research institutes or private companies may be well to their query. In systems where information from multiple sources is used, such knowledge may assist of Toronto, Canada jm@cs.toronto.edu Abstract Modern information systems often store data that has been

  18. Matrix Completion with Queries Natali Ruchansky

    E-Print Network [OSTI]

    Crovella, Mark

    Matrix Completion with Queries Natali Ruchansky Boston University natalir@cs.bu.edu Mark Crovella applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data- analysis task for these datasets is matrix

  19. Extracting and Querying Probabilistic Information in BayesStore

    E-Print Network [OSTI]

    Wang, Zhe

    2011-01-01

    68 Join over Model M F OBN Viterbi SQL74 SQL Implementation of MCMCjoin algorithms. . 99 The SQL+IE query template. . . . . . .

  20. Metadata Challenge for Query Processing Over Heterogeneous Wireless Sensor Network

    E-Print Network [OSTI]

    Komalavalli, C

    2011-01-01

    Wireless sensor networks become integral part of our life. These networks can be used for monitoring the data in various domain due to their flexibility and functionality. Query processing and optimization in the WSN is a very challenging task because of their energy and memory constraint. In this paper, first our focus is to review the different approaches that have significant impacts on the development of query processing techniques for WSN. Finally, we aim to illustrate the existing approach in popular query processing engines with future research challenges in query optimization.

  1. ask queries | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX ECoop IncIowa (UtilityMichigan) JumpZhuyuanWindeyZibo BaoyunZoukask queries Home

  2. March 24, 2008 ADBS: Query Opt. 1 Algorithms for Query Processing and

    E-Print Network [OSTI]

    Adam, Salah

    Algebra SELECT LNAME, FNAME FROM EMPLOYEE WHERE SALARY > ( SELECT MAX (SALARY) FROM EMPLOYEE WHERE DNO = 5); SELECT MAX (SALARY) FROM EMPLOYEE WHERE DNO = 5 SELECT LNAME, FNAME FROM EMPLOYEE WHERE SALARY > C MAX SALARY (DNO=5 (EMPLOYEE))LNAME, FNAME (SALARY>C(EMPLOYEE)) #12;March 24, 2008 ADBS: Query Opt. 7

  3. AutoEval: An Evaluation Methodology for Evaluating Query Suggestions Using Query Logs

    E-Print Network [OSTI]

    Kruschwitz, Udo

    . User evaluations of search engines are expensive and not easy to replicate. The problem is even more pronounced when assessing adap- tive search systems, for example system-generated query modification suggestions that can be derived from past user interactions with a search engine. Automatically predicting

  4. Input-Sensitive Scalable Continuous Join Query This paper considers the problem of scalably processing a large number of continuous queries. Our

    E-Print Network [OSTI]

    Agarwal, Pankaj K.

    Input-Sensitive Scalable Continuous Join Query Processing Anonymous This paper considers the problem of scalably processing a large number of continuous queries. Our approach, consisting of novel in query predicates for efficient group processing. We partition the collection of continuous queries

  5. A RETRIEVAL PATTERN-BASED INTER-QUERY LEARNING APPROACH FOR CONTENT-BASED IMAGE RETRIEVAL

    E-Print Network [OSTI]

    Qi, Xiaojun

    -query learning (a.k.a., short- term learning) to perform query tuning in a single retrieval session. Recently, inter-query learning (a.k.a., long-term learning) has been employed to further improve retrieval

  6. Adaptive Query Processing in Mobile Environment Hocine Grine

    E-Print Network [OSTI]

    Madiraju, Praveen

    . Furthermore, query optimization and execution must take into account available resources in or- der computing. In this context, actual query evaluation and op- timization techniques in distributed databases Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems--distributed applications; H.2

  7. PackageBuilder: Querying for packages of tuples Kevin Fernandes

    E-Print Network [OSTI]

    Meliou, Alexandra

    to query a database of recipes to retrieve all the gluten-free meals, assuming that the amount of gluten be gluten-free. This example cannot be expressed in traditional SQL: SQL queries can easily check conditions. For example, in the meal planner application, the gluten-free restriction is a base constraint, as it can

  8. Energy-Efficient Aggregate Query Evaluation in Sensor Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Energy-Efficient Aggregate Query Evaluation in Sensor Networks Zhuoyuan Tu and Weifa Liang efficiently. This paper considers the aggregate query evaluation in a sensor network database, wliang}@cs.anu.edu.au Abstract. Sensor networks, consisting of sensor devices equipped with energy

  9. Article ID: Query Translation on the Fly in Deep Web

    E-Print Network [OSTI]

    Article ID: Query Translation on the Fly in Deep Web Integration Jiang Fangjiao, Jia Linlin, Meng users to access the desired information, many researches have dedicated to the Deep Web (i.e. Web databases) integration. We focus on query translation which is an important part of the Deep Web integration

  10. Maximizing the Sustained Throughput of Distributed Continuous Queries

    E-Print Network [OSTI]

    Palpanas, Themis

    the query plans that maximize throughput and adhere to the input profile. Examples of data stream managementMaximizing the Sustained Throughput of Distributed Continuous Queries Ioana Stanoi, George Mihaila of execution time for every incoming data tuple, which leads to an upper bound on the rate at which tuples can

  11. Materialized View Selection and Maintenance Using Multi-Query Optimization

    E-Print Network [OSTI]

    Ramamritham, Krithi

    Materialized View Selection and Maintenance Using Multi-Query Optimization Hoshi Mistry ¡ Prasan the differentials as above. Our work addresses the problem of optimizing the main- tenance of a set of materialized Materialized views have been found to be very effective at speeding up queries, and are increasingly being

  12. A Statistical Approach for Achievable Dose Querying in IMRT Planning

    E-Print Network [OSTI]

    Kazhdan, Michael

    Introduction We explore a data-driven approach for achievable dose querying in intensity- modulated radiation specifies too low a target dose to the OAR, the treatment plan may not be realiz- able and the treatmentA Statistical Approach for Achievable Dose Querying in IMRT Planning Patricio Simari1 , Binbin Wu2

  13. Query Specific Fusion for Image Retrieval Shaoting Zhang2

    E-Print Network [OSTI]

    Chen, Kuang-Yu

    Query Specific Fusion for Image Retrieval Shaoting Zhang2 , Ming Yang1 , Timothee Cour1 , Kai Yu1 indexed by compact hashing codes both demonstrate excellent scalability. However, their retrieval propose a graph-based query specific fusion approach where multiple retrieval sets are merged and reranked

  14. Efficient Query Processing on Graph Databases JAMES CHENG

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    . In this article, we propose an efficient index, FG*-index, to solve this problem. The cost of processing a subgraph query using most existing indexes mainly consists of two parts, the index probing cost and the candidate verification cost. Index probing is to find the query in the index, or to find the graphs from

  15. Window Query Processing in Linear Quadtrees Ashraf Aboulnaga

    E-Print Network [OSTI]

    Aboulnaga, Ashraf

    blocks and searching for these quadtree blocks in the linear quadtree index. The cost model is also based/O cost of processing a window query, and it uses two very simple parameters of the linear quadtree index the query window to search the B-tree. We also present a cost model that estimates the I/O cost

  16. Top-Down XML Keyword Query Processing Junfeng Zhou1

    E-Print Network [OSTI]

    New South Wales, University of

    keyword query w.r.t. LCA/SLCA/ELCA semantics. By "top-down", we mean that we visit all common ancestor (CA to define meaningful results, for which the basic semantics is Lowest Common Ancestor (LCA). Based on LCA, the most widely adopted query semantics are Exclusive LCA (ELCA) [3,7,10,23,27] and Smallest LCA (SLCA) [3

  17. A Foundation for Conventional and Temporal Query Optimization

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing

  18. Efficient Temporal Coalescing Query Support in Relational Database Systems

    E-Print Network [OSTI]

    Zaniolo, Carlo

    demand for temporal databases have only in- creased with time; unfortunately, DBMS vendors and standard by the lessons learned from the very history of temporal databases, where past proposals failed to gain much temporal query models with current DBMS engines [5]. Even if temporal database and query model can be well

  19. Efficient Consistency Proofs for Generalized Queries on a Committed Database

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Efficient Consistency Proofs for Generalized Queries on a Committed Database Rafail Ostrovsky UCLA@csail.mit.edu July 20, 2004 Abstract A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy

  20. Efficient Consistency Proofs for Generalized Queries on a Committed Database

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Efficient Consistency Proofs for Generalized Queries on a Committed Database #3; Rafail Ostrovsky asmith@csail.mit.edu July 20, 2004 Abstract A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any

  1. Modeling and Querying Video Databases \\Lambda Cyril Decleir

    E-Print Network [OSTI]

    Baader, Franz

    Modeling and Querying Video Databases \\Lambda Cyril Decleir LISI­INSA Lyon, Bâ??atiment 501 F­69621 database point of view, video data presents an interesting challenge in the development of data models is essential for providing content based access. This paper develops a data model and a rule­based query

  2. SQL Reference Learning Gupta SQLBase Structured Query Language

    E-Print Network [OSTI]

    SQL Reference Learning Gupta SQLBase Structured Query Language (SQL) By William Sprouse CENTER, CO 80523 Spring 1996 #12;SQL Reference Learning Gupta SQLBase Structured Query Language (SQL.1.2.4 The Clipboard 5 2.2 GETTING STARTED 5 2.2.1 STARTING QUEST 5 2.2.2 GETTING HELP 6 3. SQL BASICS 6 3

  3. Automatic Word Similarity Detection for TREC 4 Query Expansion

    E-Print Network [OSTI]

    Kansas, University of

    Boolean queries by including terms from an online thesaurus was able to improve search results (Gauch the query. However, the latter two approaches require the presence of an online thesaurus whose words closely match the contents of the database. #12;Where can such a thesaurus come from? In some cases

  4. LOGICAL QUERY COMPOSITION FROM LOCAL VISUAL FEATURE THESAURUS

    E-Print Network [OSTI]

    Fauqueur, Julien

    LOGICAL QUERY COMPOSITION FROM LOCAL VISUAL FEATURE THESAURUS Julien FAUQUEUR and Nozha BOUJEMAA photometric thesaurus. It gives an overview of the database content in the query interface. Unsupervised generation of this thesaurus is based on grouping similar regions into "region categories". The user can

  5. Properties and Application of Nondeterministic Quantum Query Algorithms

    E-Print Network [OSTI]

    Alina Dubrovska Vasilieva

    2006-11-07

    Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we demonstrate a gap of n vs. 2 between classical deterministic and dual nondeterministic quantum query complexity for a specific Boolean function.

  6. A Digital Watermarking Approach to Secure and Precise Range Query Processing in Sensor Networks

    E-Print Network [OSTI]

    Liu, Alex X.

    . In this paper, we propose QuerySec, a protocol that enables storage nodes to process queries correctly while queries, which allows storage nodes to process queries correctly without knowing the actual values of both of sending to the sink via multiple hops, which saves energy for sensors. Second, storage nodes store sensor

  7. Fall 2011 CIS 452 STRUCTURED QUERY LANGUAGE (SQL) Course Number: CIS 452

    E-Print Network [OSTI]

    Diestel, Geoff

    Fall 2011 CIS 452 STRUCTURED QUERY LANGUAGE (SQL) Course Number: CIS 452 Course Name: Structured Query Language (SQL) Catalog Description: (2010-2011) A study of SQL, including relational database schema in SQL, formulating SQL queries and sub queries of varying complexity, embedding SQL statements

  8. Say What? Why users choose to speak their web queries Maryam Kamvar, Doug Beeferman

    E-Print Network [OSTI]

    Cortes, Corinna

    a higher probability of being typed than shorter queries. Index Terms: speech, voice, search, Google, query of voice web search (where the query is entered by speaking rather than by keyboard) is sparse, most likely on an aggregate level factors that are correlated with a decision to speak a web search query rather than type it

  9. HDF5-FastQuery: An API for Simplifying Access to Data Storage,Retrieval, Indexing and Querying

    SciTech Connect (OSTI)

    Bethel, E. Wes; Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu,Kesheng

    2006-06-15

    This work focuses on research and development activities that bridge a gap between fundamental data management technology index, query, storage and retrieval and use of such technology in computational and computer science algorithms and applications. The work has resulted in a streamlined applications programming interface (API) that simplifies data storage and retrieval using the HDF5 data I/O library, and eases use of the FastBit compressed bitmap indexing software for data indexing/querying. The API, which we call HDF5-FastQuery, will have broad applications in domain sciences as well as associated data analysis and visualization applications.

  10. Query-Driven Visualization and Analysis

    SciTech Connect (OSTI)

    Ruebel, Oliver; Bethel, E. Wes; Prabhat, Mr.; Wu, Kesheng

    2012-11-01

    This report focuses on an approach to high performance visualization and analysis, termed query-driven visualization and analysis (QDV). QDV aims to reduce the amount of data that needs to be processed by the visualization, analysis, and rendering pipelines. The goal of the data reduction process is to separate out data that is "scientifically interesting'' and to focus visualization, analysis, and rendering on that interesting subset. The premise is that for any given visualization or analysis task, the data subset of interest is much smaller than the larger, complete data set. This strategy---extracting smaller data subsets of interest and focusing of the visualization processing on these subsets---is complementary to the approach of increasing the capacity of the visualization, analysis, and rendering pipelines through parallelism. This report discusses the fundamental concepts in QDV, their relationship to different stages in the visualization and analysis pipelines, and presents QDV's application to problems in diverse areas, ranging from forensic cybersecurity to high energy physics.

  11. Running the AP DDR Query in PeopleSoft 8.8 1 Running the AP DDR Query in PeopleSoft 8.8

    E-Print Network [OSTI]

    Barrash, Warren

    Running the AP DDR Query in PeopleSoft 8.8 1 Running the AP DDR Query in PeopleSoft 8.8 People Novell user ID and password and click the Sign In button. #12;Running the AP DDR Query in PeopleSoft 8: In the top border of your window you will see your user Id. #12;Running the AP DDR Query in PeopleSoft 8.8 3

  12. CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao Liu

    E-Print Network [OSTI]

    Shamos, Michael I.

    CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao: Deep Web, Deep Web Surfacing, Minimum Executable Pattern, Adaptive Query Abstract: This paper proposes-based Deep Web adaptive query method. The query method extends query interface from single textbox to MEP set

  13. Recap Dictionaries Wildcard queries Edit distance Spelling correction Soundex Introduction to Information Retrieval

    E-Print Network [OSTI]

    Nejdl, Wolfgang

    Dictionaries Wildcard queries Edit distance Spelling correction Soundex Skip pointers 16 28 72 5 51 98 2 4 8 16

  14. Poster Abstract: Energy-Efficient Data Organization and Query Processing in Sensor Networks

    E-Print Network [OSTI]

    Shahabi, Cyrus

    stor- age and query processing techniques called Data-Centric Storage that leverages locality, Performance, Experimentation Keywords: Sensor Networks, Data-Centric Storage, DCS, Data Organization, Query queries fall under one of the two broad categories namely, Data-Centric Routing (DCR) and Data-Centric

  15. Scalable Continuous Query Processing by Tracking Pankaj K. Agarwal Junyi Xie Jun Yang Hai Yu

    E-Print Network [OSTI]

    Agarwal, Pankaj K.

    Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai}@cs.duke.edu ABSTRACT This paper considers the problem of scalably processing a large number of continuous queries for group-processing and indexing hundreds of thousands of continuous queries. In our approach, we first

  16. Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai Yu

    E-Print Network [OSTI]

    Yang, Jun

    Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai}@cs.duke.edu Abstract This paper considers the problem of scalably processing a large number of continuous queries. We for intervals in linear time. 1 Introduction Continuous query processing has attracted much interest

  17. SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources

    E-Print Network [OSTI]

    Agrawal, Gagan

    SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources Fan Wang Gagan that are hidden behind query forms, thus forming what is re- ferred to as the deep web. In this paper, we propose SEEDEEP, a System for Exploring and quErying scientific DEEP web data sources. SEEDEEP is able

  18. Efficient XML-to-SQL Query Translation: Where to Add the Intelligence?

    E-Print Network [OSTI]

    Pennsylvania, University of

    Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? Rajasekar Krishnamurthy of queries generated by XML to SQL translation. We first show that published XML-to-SQL query translation algo- rithms are suboptimal in that they often trans- late simple path expressions into complex SQL

  19. Efficient discrete-time simulations of continuous-time quantum query algorithms

    E-Print Network [OSTI]

    R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo

    2008-11-26

    The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.

  20. A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang

    E-Print Network [OSTI]

    Wong, Limsoon

    A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang Bio effectively query protein patents. This system uses Kleisli to tie to­ gether the following sources to answer queries on protein patents that are considerably more demanding than simple free­text search: (1

  1. Query Cost Estimation through Remote System Contention States Analysis over the Internet

    E-Print Network [OSTI]

    Liu, Weiru

    Query Cost Estimation through Remote System Contention States Analysis over the Internet Weiru Liu costs of possible query plans in order to select the best one with the minimum cost. In this context, the cost of a query is affected by three factors: network congestion, server contention state

  2. Static Query Result Caching Revisited Rifat Ozcan, Ismail Sengor Altingovde, zgr Ulusoy

    E-Print Network [OSTI]

    Ulusoy, �zgür

    Static Query Result Caching Revisited Rifat Ozcan, Ismail Sengor Altingovde, �zgür Ulusoy first review several query features that are used to determine the contents of a static result cache and effectiveness). General Terms Performance, Experimentation. Keywords Search engine, static caching, query result

  3. Query Suggestion based on User Landing Pages Silviu Cucerzan and Ryen W. White

    E-Print Network [OSTI]

    Cucerzan, Silviu

    formulation, search process. General Terms Algorithms, Experimentation, Human Factors. Keywords Search engine results page, may not contain the queried terms, or may not even be indexed by the search engine users' post-query navigation patterns and the query logs of a large search engine. We compare

  4. SEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES

    E-Print Network [OSTI]

    Jansen, James

    search engine. From this data set, terms were used to identify queries for audio, image, and video multimedia files by searching for file extensions and matching the filename to terms in the query (WittenSEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES Bernard J. Jansen

  5. A SingleQuery BiDirectional Probabilistic Roadmap Planner with Lazy Collision Checking

    E-Print Network [OSTI]

    LaValle, Steven M.

    1 A Single­Query Bi­Directional Probabilistic Roadmap Planner with Lazy Collision Checking Gildardo probabilistic roadmap (PRM) planner that is: single­query --it does not pre­compute a roadmap, but uses the two the robot's free space by concurrently building a roadmap made of two trees rooted at the query

  6. Automatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf Trieschnigg,

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    Terms Algorithms, Human Factors, Design Keywords Automatic Query Expansion, Search Behavior, 1 children may make. Most of the search engines offer only the possibility to enter a Boolean queryAutomatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf

  7. A New ClientServer Architecture for Distributed Query Processing

    E-Print Network [OSTI]

    with an essentially ``free'' backward reduction capability is proposed. We explore in detail the benefits and costsA New Client­Server Architecture for Distributed Query Processing Zhe Li Kenneth A. Ross Computer Science Department Computer Science Department Columbia University Columbia University New York, NY 10027

  8. Active Query Forwarding in Sensor Networks Narayanan Sadagopan

    E-Print Network [OSTI]

    Krishnamachari, Bhaskar

    , response latency and storage requirements. We show that with optimal parameter settings, depending on the update frequency, ACQUIRE obtains order of magnitude reduction over FBQ and potentially 60 to 85% energy days with a frequency of 1 measurement per hour") versus One-shot queries, which have a simple response

  9. STQL --A SPATIO-TEMPORAL QUERY LANGUAGE Martin Erwig

    E-Print Network [OSTI]

    Erwig, Martin

    evolutions of spatial objects over time. We consider spatio- temporal operations that are particularly useful is to provide a DBMS data model and query language capable of handling such time-dependent geome- tries. Thereby. Our modeling also includes the sim- pler, discrete case where temporal evolutions are stepwise

  10. Answering Table Queries on the Web using Column Rakesh Pimplikar

    E-Print Network [OSTI]

    Sarawagi, Sunita

    , India rakesh.pimplikar@in.ibm.com Sunita Sarawagi IIT Bombay Mumbai, India sunita@iitb.ac.in ABSTRACT We, . . . , Qq, decide for each Ti if it is relevant to Q and if so, identify the mapping between the columns of Ti and query columns. We represent this task as a graphical model that jointly maps all tables

  11. CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing

    E-Print Network [OSTI]

    Ng, Wee Siong

    In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities ...

  12. On the Query Complexity of Perfect Gate Discrimination

    E-Print Network [OSTI]

    D'Ariano, Giacomo Mauro

    On the Query Complexity of Perfect Gate Discrimination Giulio Chiribella1 , Giacomo Mauro D'Ariano2 both deterministic strategies. For unambiguous gate discrimination, where errors are not tolerated that there is no difference between perfect probabilistic and perfect determin- istic gate discrimination. Hence, evaluating

  13. Dynamic LCA Queries on Trees # Richard Cole + Ramesh Hariharan #

    E-Print Network [OSTI]

    Cole, Richard

    Dynamic LCA Queries on Trees # Richard Cole + Ramesh Hariharan # Abstract We show how to maintain. The primary use of LCA computations in a su#x tree is to determine the longest common prefix of two substrings common ancestor of the corresponding nodes. The first constant time LCA computation algorithm was due

  14. Adaptable Query Optimization and Evaluation in Temporal Middleware

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    that such data- base applications may benefit substantially from built-in temporal support in the DBMS the DBMS proper or as a source level translation from temporal queries to conventional SQL. This paper proposes a new approach: using a middleware component on top of a conventional DBMS. This component accepts

  15. A Query Answering System for Data with Evolution Relationships

    E-Print Network [OSTI]

    Velegrakis, Yannis

    for exploiting the evolution relationships between the structures in the database. In particular, our system]: Miscellaneous General Terms Algorithms, Performance Keywords Data evolution, Probabilistic databases, GraphA Query Answering System for Data with Evolution Relationships Siarhei Bykau University of Trento

  16. Relational Databases for Querying XML Documents: Limitations and Opportunities

    E-Print Network [OSTI]

    Bertini, Robert L.

    ­ structured data models and query languages for this purpose, this paper explores the more conservative, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise@microsoft.com Abstract XML is fast emerging as the dominant standard for representing data in the World Wide Web

  17. Mining Databases and Data Streams with Query Languages and Rules

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Mining Databases and Data Streams with Query Languages and Rules Carlo Zaniolo Computer Science that are beyond the reach of traditional Data Base Management Systems (DBMS), data mining stands out because extensions that have proven very effective at supporting data mining. Finally, we turn our attention

  18. DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES

    E-Print Network [OSTI]

    Dustdar, Schahram

    DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES Muhammad Intizar Ali, Reinhard,dustdar}@infosys.tuwien.ac.at Keywords: Data Services, Database as a Service, Data Services Integration, Data Concerns, XQuery. Abstract: There is an increasing trend for organizations to publish data over the web using data services. The published data

  19. Dynamic Query Optimization under Access Limitations and Dependencies

    E-Print Network [OSTI]

    Calvanese, Diego

    : Unlike relational tables in a database, data sources on the Web typically can only be accessed in limited ways. In particular, some of the source fields may be required as input and thus need to be mandatorily filled in order to access the source. Answering queries over sources with access limitations is a complex

  20. Taxonomy and synthesis of Web services querying languages

    E-Print Network [OSTI]

    Bitar, Ibrahim El; Roudies, Ounsa

    2012-01-01

    Most works on Web services has focused on discovery, composition and selection processes of these kinds of services. Other few works were interested in how to represent Web services search queries. However, these queries cannot be processed by ensuring a high level of performance without being adequately represented first. To this end, different query languages were designed. Even so, in the absence of a standard, these languages are quite various. Their diversity makes it difficult choosing the most suitable language. In fact, this language should be able to cover all types of preferences or requirements of clients such as their functional, nonfunctional,temporal or even specific constraints as is the case of geographical or spatial constraints and meet their needs and preferences helping to provide them the best answer. It must also be mutually simple and imposes no restrictions or at least not too many constraints in terms of prior knowledge to use and also provide a formal or semi-formal queries presentat...

  1. Multi-Query Feedback Motion Planning with LQR-Roadmaps

    E-Print Network [OSTI]

    Jackson, Daniel

    Multi-Query Feedback Motion Planning with LQR-Roadmaps Anirudha Majumdar School of Engineering "roadmap", with each segment representing a locally optimal trajectory of the system and a continuous) - and for parameterized finite-time invariance around a trajectory, as well as a "roadmap" construction al- gorithm

  2. IBM Haifa Research Lab 2010 IBM Corporation Query Performance Prediction

    E-Print Network [OSTI]

    Kurland, Oren

    IBM Haifa Research Lab © 2010 IBM Corporation Query Performance Prediction for IR David Carmel, IBM Haifa Research Lab Oren Kurland, Technion SIGIR Tutorial Portland Oregon, August 12, 2012 IBM Labs. David Carmel Research Staff Member at the Information Retrieval group at IBM Haifa Research Lab Ph

  3. Advanced SQL To write queries using nested select statements.

    E-Print Network [OSTI]

    Liang, Y. Daniel

    with the highest salary. You may attempt to solve the query using the following statement: select lastName || ', ' || firstName as "Name", salary from Faculty where salary = max(salary); This is erroneous because lastName || ', ' || firstName as "Name", salary from Faculty where salary = (select max(salary) from

  4. SUPPORTING SKYLINE QUERIES ON CATEGORICAL DATA IN WEB INFORMATION SYSTEMS

    E-Print Network [OSTI]

    Balke, Wolf-Tilo

    Electrical Engineering and Computer Science University of California, Berkeley, USA balke@eecs.berkeley.edu Ulrich Güntzer Institut für Informatik Universität Tübingen, Tübingen, Germany guentzer applications are economical choices e.g. a product's expected lifetime against its price. Skyline queries

  5. Bounded Conjunctive Queries Yang Cao1,2

    E-Print Network [OSTI]

    Fan, Wenfei

    of Edinburgh 2 RCBD and SKLSDE Lab, Beihang University 3 Facebook Inc. {Y.Cao-17@sms, wenfei@inf}.ed.ac.uk woty can reduce big D to a "small" DQ of a manageable size. Many real-life queries are actually (effectively) bounded. Example 1: Social networks, e.g., Facebook, allow us to tag a photo and show who

  6. Querying a Bioinformatic Data Sources Registry with Concept Lattices

    E-Print Network [OSTI]

    Devignes, Marie-Dominique

    on metadata reflecting information about sources rather than on data extracted from documents. Formal concept323 Querying a Bioinformatic Data Sources Registry with Concept Lattices Nizar Messai, Marie Bioinformatic data sources available on the web are multi- ple and heterogenous. The lack of documentation

  7. A Technique for Power-Aware Query-Informed Routing in Support of Long-Duration Queries for Sensor Networks

    E-Print Network [OSTI]

    Shatz, Sol M.

    informed" method enables the query process to be efficient in terms of energy consumption. The technique inventory, and healthcare, to military environments. Specific applications include wildlife tracking [6 is the energy constraint, which is a major objective in recent research on the design of sensor network systems

  8. Answering SPARQL Queries over Databases and under OWL 2 QL Entailment Regime

    E-Print Network [OSTI]

    Zakharyaschev, Michael

    of Computer Science and Information Systems, Birkbeck, University of London, U.K. 2 Faculty of Computer Science, Free University of Bozen-Bolzano, Italy 3 IBM T.J. Watson Research Center, Yorktown Heights, NY have been implemented in both academia and industry; e.g., [26,29,23,3,22,14,11,7,19,21]. Most of them

  9. VIQI: A New Approach for Visual Interpretation of Deep Web Query Interfaces

    E-Print Network [OSTI]

    Boughamoura, Radhouane; Omri, Mohamed Nazih

    2012-01-01

    Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.

  10. The Niagara Internet Query System Jeffrey Naughton, David DeWitt, David Maier, Ashraf Aboulnaga, Jianjun Chen,

    E-Print Network [OSTI]

    Bertini, Robert L.

    The Niagara Internet Query System Jeffrey Naughton, David DeWitt, David Maier, Ashraf Aboulnaga, merely being an XML query-processing engine does not render a system suitable for querying the Internet, or are infinite streams, or both. The Niagara Internet Query System was designed from the bottom-up to provide

  11. ObjectGlobe: Ubiquitous Query Processing on the Internet

    E-Print Network [OSTI]

    Kemper, Alfons

    for scalable Internet applications, such as business-to-business (B2B) e-commerce systems like SAP's "mySAP capabilities. The goal of the ObjectGlobe project is to establish an open market place in which data and query on the Internet. One of the main challenges in the design of such an open system is to ensure privacy and security

  12. Optimised Phrase Querying and Browsing of Large Text Databases Dirk Bahle Hugh E. Williams Justin Zobel

    E-Print Network [OSTI]

    Zobel, Justin

    ://www.searchenginewatch.com/ efficient--that is, able to find documents quickly--when users pose informal ranked queries or Boolean

  13. Reordering an index to speed query processing without loss of effectiveness.

    E-Print Network [OSTI]

    Hawking, David

    of CO2 emissions. To illustrate the importance o world wide web search engines, a factor of two in query processing effi- ciency could translate

  14. QCS: a system for querying, clustering and summarizing documents.

    SciTech Connect (OSTI)

    Dunlavy, Daniel M.; Schlesinger, Judith D. (Center for Computing Sciences, Bowie, MD); O'Leary, Dianne P. (University of Maryland, College Park, MD); Conroy, John M. (Center for Computing Sciences, Bowie, MD)

    2006-10-01

    Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence 'trimming', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

  15. Energy-Efficient Data Organization and Query Processing in Sensor Networks

    E-Print Network [OSTI]

    a class of data stor- age and query processing techniques called Data-Centric Storage that leverages approaches to organizing data and processing queries fall under one of the two broad categories namely, Data-Centric Routing (DCR) and Data-Centric Storage (DCS). In DCR, the data generated by the sensors is stored

  16. The OLAP-Enabled Grid: Model and Query Processing Algorithms Michael Lawrence Andrew Rau-Chaplin

    E-Print Network [OSTI]

    Rau-Chaplin, Andrew

    is on the efficient optimization of resources for answering queries based on a distributed query algorithm which uses com- puting resources. Grids, widely distributed collections of heterogeneous computers whose.cgmLab.org Abstract The operation of modern distributed enterprises, be they commercial, scientific, or health related

  17. Classifying the user intent of web queries using k-means

    E-Print Network [OSTI]

    Jansen, James

    , Queensland University of Technology, Brisbane, Australia Abstract Purpose ­ Web search engines are frequently 75 percent of web queries (clustered into eight classifications) are informational in nature the intents of the user queries. Automatic classification of user intent can lead to improved web search

  18. Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo

    E-Print Network [OSTI]

    Ives, Zachary G.

    Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo University is that of specifying the transformation rules and search process of a query optimizer [1]. In certain emerging domains universally understood than the languages used in transformational optimizers like those generated by Volcano

  19. Join Synopses for Approximate Query Answering Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    optimizer to estimate plan costs; such an application demands very fast response times but not exact answers to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full solely on providing exact answers to queries, in a manner that seeks to minimize response time

  20. Figure 1. IDVL interface showing 12 documents returned for "El Nio" query along with different multimedia

    E-Print Network [OSTI]

    Wactlar, Howard D.

    to evaluate them. We aggregate and integrate video content on-demand to enable summarization and visualization that provides the users with coherent responses to their queries in a useful broader context, perhaps library, i.e., metadata, to return a set of video documents in response to a user query, as shown

  1. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System

    E-Print Network [OSTI]

    Liu, Ling

    MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile. Significant research efforts have been dedicated to techniques for efficient processing of spatial continuous and scalable solution to processing continuously moving queries on moving objects and describe the design

  2. Query Planning for Searching Inter-Dependent Deep-web Databases

    E-Print Network [OSTI]

    Agrawal, Gagan

    Query Planning for Searching Inter-Dependent Deep-web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

  3. Query Planning for Searching Inter-dependent Deep-Web Databases

    E-Print Network [OSTI]

    Jin, Ruoming

    Query Planning for Searching Inter-dependent Deep-Web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

  4. Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition

    E-Print Network [OSTI]

    Meng, Weiyi

    Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition that abstract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive, simple, and powerful query-based invocation system to end users. Web services based

  5. All-Nearest-Neighbors Queries in Spatial Databases School of Computer Engineering

    E-Print Network [OSTI]

    Papadias, Dimitris

    applications: · Geographical Information Systems: Example queries include "find the nearest parking lot to the use of ANN queries, as opposed to previous quadratic-cost approaches. · Computer Architecture/VLSI design: The operability and speed of very large circuits depends on the relative distance between

  6. Anonymous Query Processing in Road Networks Kyriakos Mouratidis, Man Lung Yiu

    E-Print Network [OSTI]

    Yiu, Man Lung

    -based services (LBS). Due to the nature of spatial queries, an LBS needs the user position in order to pro- cess spatial query processing, but the main challenge in the LBS industry is of a different nature, etc. User privacy may be threatened because of the sensitive nature of accessed data; e.g., inquiring

  7. Prioritized Sequencing for Efficient Query on Broadcast Geographical Information in Mobile-Computing

    E-Print Network [OSTI]

    Gruenwald, Le

    in improving query efficiency in geographical information broadcast systems. We also proved the linearPrioritized Sequencing for Efficient Query on Broadcast Geographical Information in Mobile and efficient way to disseminate public geographical information to massive users. In this paper, we use R

  8. Ontology-based Query Construction for GeoCLEF and Gnter Neumann2

    E-Print Network [OSTI]

    Neumann, Günter

    : Geographical Information Retrieval, query expansion, ontology 1 Introduction The goal of geographic information). As for GIR, since geographic variation is an important criterion for evaluating such systems, we assume the traditional information retrieval, we focus more on the query expansion instead of document ranking. We parse

  9. Yuan, M. and J. McIntosh. 2002. A Typology of Spatiotemporal Information Queries. Mining

    E-Print Network [OSTI]

    Yuan, May

    1 Chapter Yuan, M. and J. McIntosh. 2002. A Typology of Spatiotemporal Information Queries. Mining Spatiotemporal Information Systems. K. Shaw, R. Ladner, and M. Abdelguerfi (eds.). Kuwer Academic Publishers. PP. 63-82. A Typology of Spatiotemporal Information Queries May Yuan and John McIntosh Department

  10. Flexible and Scalable CostBased Query Planning in Mediators: A Transformational

    E-Print Network [OSTI]

    Ambite, José Luis

    the utility of a plan decreases with time, thus a trade­off between planning time and plan qualityFlexible and Scalable Cost­Based Query Planning in Mediators: A Transformational Approach Jos to networked information. Query planning, the task of generating a cost­efficient plan that computes a user

  11. Algebra-to-SQL Query Translation for Spatio-Temporal Databases

    E-Print Network [OSTI]

    Libre de Bruxelles, Université

    of transforming the queries expressed for the conceptual schema into an operational query for a target DBMS or GIS their applications, such specifications must be translated into the operational model of current DBMS or GIS who have little technical knowledge of the underlying DBMS or GIS software. #12;The MurMur project

  12. ARGUS: Efficient Scalable Continuous Query Optimization for Large-Volume Data Streams

    E-Print Network [OSTI]

    Carbonell, Jaime

    , and topological query network optimization. Building on top of a DBMS, the system provides a value-adding package to directly running the continuous queries on the DBMS, ARGUS achieves well over a 100-fold improvement processing becomes increasingly demanding. It readily arises from the existing DBMS applications to manage

  13. Representing and Querying the Evolution of Databases and their Schemas in Fusheng Wang and Carlo Zaniolo

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Representing and Querying the Evolution of Databases and their Schemas in XML Fusheng Wang surprisingly effective solutions to the problem of representing and querying the evolution of databases for evolution [20, 19, 13]. Meanwhile, there is much current interest in publishing and viewing database

  14. SQL4X: A Flexible Query Language for XML and Relational Databases

    E-Print Network [OSTI]

    Kanza, Yaron

    SQL4X: A Flexible Query Language for XML and Relational Databases Sara Cohen, Yaron Kanza, and Yehoshua Sagiv The Hebrew University, Institute of Computer Science, Jerusalem 91904, Israel Abstract. SQL4. Using SQL4X, one can create both relations and XML documents as query results. Thus, SQL4X can

  15. SQL is Dead; Long Live SQL: Lightweight Query Services for Ad Hoc Research Data

    E-Print Network [OSTI]

    Matrajt, Graciela

    SQL is Dead; Long Live SQL: Lightweight Query Services for Ad Hoc Research Data Bill Howe billhowe with ad hoc scientific Q&A. Further: · We reject the conventional wisdom that "scientists won't write SQL a production-quality database server. · We observe that simply sharing examples of SQL queries allows

  16. Modeling and Querying Metadata in the Semantic Sensor Web: the Model stRDF and the

    E-Print Network [OSTI]

    Koubarakis, Manolis

    Modeling and Querying Metadata in the Semantic Sensor Web: the Model stRDF and the Query Language extend RDF, which will often be the metadata model of choice in the Semantic Sensor Web, with a uniform and Kapodistrian University of Athens Greece {koubarak,kkyzir}@di.uoa.gr Abstract. RDF will often be the metadata

  17. Querying Big Data: Bridging Theory and Practice Wenfei Fana,b

    E-Print Network [OSTI]

    Fan, Wenfei

    Querying Big Data: Bridging Theory and Practice Wenfei Fana,b , Jinpeng Huaib aInternational Research Center on Big Data, Beihang University, Beijing, No.37 XueYuan Road, 100083, Beijing, China Abstract Big data introduces challenges to query answering, from theory to practice. A number of questions

  18. Continuous Query Processing of Spatio-temporal Data Streams in PLACE

    E-Print Network [OSTI]

    Mokbel, Mohamed F.

    of Calgary, Calgary, Alberta E-mail:hammad@cpsc.ucalgary.ca Abstract. The tremendous increase in the use as queries are continuously moving. In this paper, we present a continuous query processor designed receive data from mobile objects (e.g., moving vehicles in road networks). The streaming nature

  19. Window-aware Load Shedding for Aggregation Queries over Data Streams

    E-Print Network [OSTI]

    - tem must shed load in order to maintain low-latency query results. In this paper, we describe a loadWindow-aware Load Shedding for Aggregation Queries over Data Streams Nesime Tatbul Brown University tatbul@cs.brown.edu Stan Zdonik Brown University sbz@cs.brown.edu ABSTRACT Data stream management

  20. Combining Multiple Evidence from Dierent Types of Thesaurus for Query Expansion

    E-Print Network [OSTI]

    Nie, Jian-Yun

    Combining Multiple Evidence from Dierent Types of Thesaurus for Query Expansion Rila Mandala only one type of thesaurus has generally been used. In this paper we analyze the characteristics of dierent thesaurus types and propose a method to combine them for query ex- pansion. Experiments using

  1. RESQ: Rank-Energy Selective Query Forwarding for Distributed Search Systems

    E-Print Network [OSTI]

    decisions. Using a large-scale query log and publicly-available energy price time series, we demonstrate ranking query results and savings in temporally- and spatially-varying energy prices. Categories Deviation = $52.78/mWh Average = $111.87/mWh Figure 1: Energy price temporal and spatial varia- tion: (top

  2. Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution

    E-Print Network [OSTI]

    Gupta, Himanshu

    in a collaborative fashion, and is periodically queried by an external source to report a summary of the sensed data algorithm, and propose several optimizations to reduce the communication overhead of the algorithm. Finally certain objects of interest, say tanks. A typical query could be: Report the number of tank sightings

  3. Anti-pattern Detection with Model Queries: A Comparison of Approaches

    E-Print Network [OSTI]

    Ferenc, Rudolf

    Anti-pattern Detection with Model Queries: A Comparison of Approaches Zoltán Ujhelyi, Ákos Horváth (EMF) as an underlying representation of program models processed by three general-purpose model query with a metamod- eling framework, such as the Eclipse Modeling Framework (EMF), which offers advanced tooling

  4. Skyline Queries Against Mobile Lightweight Devices in MANETs Zhiyong Huang1

    E-Print Network [OSTI]

    Ooi, Beng Chin

    Skyline Queries Against Mobile Lightweight Devices in MANETs Zhiyong Huang1 Christian S. Jensen2 and distributed setting, where each mobile device is capable of holding only a portion of the whole dataset; where devices communicate through mobile ad hoc networks; and where a query issued by a mobile user

  5. Towards Large-Scale Collaborative Planning: Answering High-Level Search Queries Using Human Computation

    E-Print Network [OSTI]

    Chen, Yiling

    Towards Large-Scale Collaborative Planning: Answering High-Level Search Queries Using Human of Engineering and Applied Sciences Harvard University hq@eecs.harvard.edu Abstract Behind every search query is a high-level mission that the user wants to accomplish. While current search en- gines can often provide

  6. Real time search on the web: Queries, topics, and economic value Bernard J. Jansen a,

    E-Print Network [OSTI]

    Jansen, James

    examine aggregate usage of the search engine, including number of users, queries, and terms. We term interest in a topic and the polling nature of real time queries. Concerning search topics geographical affinity, pointing to a location-based aspect to real time search. In terms of economic value, we

  7. Rounds vs Queries Trade-off in Noisy Computation [Extended Abstract

    E-Print Network [OSTI]

    Saks, Michael

    Rounds vs Queries Trade-off in Noisy Computation [Extended Abstract] Navin Goyal Michael Saks OR of n bits. This answers a question of Newman [21]. We prove more general trade-offs between the number (noise-free) model, a boolean function f(x1, . . . , xn) is to be computed by querying variables

  8. Context-Sensitive Query Auto-Completion Ziv Bar-Yossef

    E-Print Network [OSTI]

    Bar-Yossef, Ziv

    , Israel nkraus@cs.technion.ac.il ABSTRACT Query auto completion is known to provide poor predictions 31905, Israel zivby@ee.technion.ac.il Naama Kraus Computer Science Department Technion Haifa 32000 that context, such as the user's recent queries, can be used to improve the prediction quality considerably

  9. Frequent query discovery: a unifying ILP approach to association rule mining

    E-Print Network [OSTI]

    Hinneburg, Alexander

    Frequent query discovery: a unifying ILP approach to association rule mining Luc Dehaspe and Hannu Celestijnenlaan 200A -- B­3001 Heverlee (Belgium) #12; Frequent query discovery: a unifying ILP approach to association rule mining Luc Dehaspe \\Lambda and Hannu Toivonen y Report CW 258, March 2, 1998 Department

  10. Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

    E-Print Network [OSTI]

    Kavraki, Lydia E.

    Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps Mert Akinc sample-based method primarily designed for multiple query planning (the Probabilistic Roadmap Method the Probabilistic Roadmap of Trees (PRT), uses a tree algorithm as a subroutine for PRM. The nodes of the PRM

  11. ROADTRACK: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness

    E-Print Network [OSTI]

    Liu, Ling

    ROADTRACK: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness Peter ROADTRACK ­ a road- network based, query-aware location update framework with two unique features. First, we road-network based check-free inter- val optimization further enhances the effectiveness of the ROAD

  12. Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization

    E-Print Network [OSTI]

    Güting, Ralf Hartmut

    -order signature (and algebra), a system of two coupled many-sorted signatures, where the top-level signature the types defined as terms of the top level. Hence the top level can be used to define a data or representation model and the bottom level to describe a query algebra or a query processing algebra. We show

  13. Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race

    E-Print Network [OSTI]

    Patel, Jignesh

    Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race Willis Lang of an energy efficiency metric along with traditional performance metrics. This change is fueled by the growing, real, and urgent demand for energy-efficient database processing. Database query processing engines

  14. Parallelizing Skyline Queries for Scalable Distribution Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Divyakant Agrawal and Amr El

    E-Print Network [OSTI]

    Zhao, Ben Y.

    a partial or­ der on query propagation in order to pipeline query execution. Our analysis shows that DSL,000 to $15,000 and mileage between 50K and 100K miles. The discussion hereafter focuses on this generalized

  15. Parallelizing Skyline Queries for Scalable Distribution Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Divyakant Agrawal,

    E-Print Network [OSTI]

    Almeroth, Kevin C.

    order on query propagation in order to pipeline query execution. Our analysis shows that DSL is optimal records within the price range of $10,000 to $15,000 and mileage between 50K and 100K miles

  16. Query-aware Test Generation Using a Relational Constraint Solver Shadi Abdul Khalek Bassem Elkarablieh Yai O. Laleye Sarfraz Khurshid

    E-Print Network [OSTI]

    Khurshid, Sarfraz

    systems (DBMS) using the Alloy tool-set. Given a database schema and an SQL query as inputs, our approach the execution result of a DBMS query processor. By incorporating both the schema and the query during is prohibitively expensive [10]. DBMS testing, in general, is a labor intensive, time consuming process, often

  17. Private Database Queries Using Quantum States with Limited Coherence Times

    E-Print Network [OSTI]

    Tad Hogg; Li Zhang

    2009-03-31

    We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable delay to allow the user to privately learn one of two items in the database without the ability to also definitely infer the second item. This quantum approach also allows the user to choose to learn other functions of the items, such as the exclusive-or of their bits, but not to gain more information than equivalent to learning one item, on average. This method is especially useful for items consisting of a few bits by avoiding the substantial overhead of conventional cryptographic approaches.

  18. Preventing SQL Injection through Automatic Query Sanitization with ASSIST

    E-Print Network [OSTI]

    Mui, Raymond; 10.4204/EPTCS.35.3

    2010-01-01

    Web applications are becoming an essential part of our everyday lives. Many of our activities are dependent on the functionality and security of these applications. As the scale of these applications grows, injection vulnerabilities such as SQL injection are major security challenges for developers today. This paper presents the technique of automatic query sanitization to automatically remove SQL injection vulnerabilities in code. In our technique, a combination of static analysis and program transformation are used to automatically instrument web applications with sanitization code. We have implemented this technique in a tool named ASSIST (Automatic and Static SQL Injection Sanitization Tool) for protecting Java-based web applications. Our experimental evaluation showed that our technique is effective against SQL injection vulnerabilities and has a low overhead.

  19. Construction of Query Concepts in a Document space based on Data Mining Techniques

    E-Print Network [OSTI]

    Chang, Y.; Kim, M.; Ounis, I.

    Chang,Y. Kim,M. Ounis,I. In Proceedings of the 6th International Conference On Flexible Query Answering Systems (FQAS 2004), Lecture Notes in Artificial Intelligence, June 24-26 2004, Lyon, France. Sun Microsystems Inc.

  20. A TALE OF TWO (SIMILAR) CITIES: Inferring City Similarity Through Geo-Spatial Query Log Analysis

    E-Print Network [OSTI]

    Cortes, Corinna

    a variety of more in-depth information about households. Advertisers often use the high-level information in the US. In contrast to the Census studies, passive studies of search engine query logs have become common

  1. An IR-based Evaluation Framework for Web Search Query Segmentation

    E-Print Network [OSTI]

    Ganguly, Niloy

    An IR-based Evaluation Framework for Web Search Query Segmentation Author 1 Author 1 Affiliation Author 1 Address Author 1 Email Author 2 Author 2 Affiliation Author 2 Address Author 2 Email ABSTRACT

  2. Top-K Queries on Uncertain Data: On Score Distribution and Typical Answers

    E-Print Network [OSTI]

    Ge, Tingjian

    2009-01-01

    Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important tool for exploring large uncertain data ...

  3. An Application of Multivariate Statistical Analysis for Query-Driven Visualization

    SciTech Connect (OSTI)

    Gosink, Luke J.; Garth, Christoph; Anderson, John C.; Bethel, E. Wes; Joy, Kenneth I.

    2010-03-01

    Abstract?Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex datasets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates non-parametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they may be used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to datasets from two different scientific domains to demonstrate its broad applicability.

  4. QuerySpaces on Hadoop for the ATLAS EventIndex

    E-Print Network [OSTI]

    Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Glasman, Claudia; Favareto, Andrea; Prokoshin, Fedor

    2015-01-01

    Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimisation. Detailed description and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

  5. QuerySpaces on Hadoop for the ATLAS EventIndex

    E-Print Network [OSTI]

    Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Favareto, Andrea; Prokoshin, Fedor; Glasman, Claudia; Toebbicke, Rainer

    2015-01-01

    A Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimization. Detailed descriptions and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

  6. A Study of "Churn" in Tweets and Real-Time Search Queries (Extended Version)

    E-Print Network [OSTI]

    Lin, Jimmy

    2012-01-01

    The real-time nature of Twitter means that term distributions in tweets and in search queries change rapidly: the most frequent terms in one hour may look very different from those in the next. Informally, we call this phenomenon "churn". Our interest in analyzing churn stems from the perspective of real-time search. Nearly all ranking functions, machine-learned or otherwise, depend on term statistics such as term frequency, document frequency, as well as query frequencies. In the real-time context, how do we compute these statistics, considering that the underlying distributions change rapidly? In this paper, we present an analysis of tweet and query churn on Twitter, as a first step to answering this question. Analyses reveal interesting insights on the temporal dynamics of term distributions on Twitter and hold implications for the design of search systems.

  7. Query complexity for searching multiple marked states from an unsorted database

    E-Print Network [OSTI]

    Bin Shang

    2006-04-10

    An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.

  8. QuPARA: Query-Driven Large-Scale Portfolio Aggregate Risk Analysis on MapReduce

    E-Print Network [OSTI]

    Rau-Chaplin, Andrew

    QuPARA: Query-Driven Large-Scale Portfolio Aggregate Risk Analysis on MapReduce Andrew Rau and reinsurance companies use stochastic simulation techniques for portfolio risk analysis. Their risk portfolios framework for portfolio risk analysis that facilitates answering a rich variety of catastrophic risk queries

  9. Web Intelligence and Agent Systems: An International Journal 0 (2010) 10 1 Selecting Queries from Sample to Crawl

    E-Print Network [OSTI]

    Lu, Jianguo

    2010-01-01

    Queries from Sample to Crawl Deep Web Data Sources Yan Wang a Jianguo Lu a,c Jie Liang a Jessica Chen crawl a deep web data source using a set of sample documents. Crawling deep web is the process of collecting data from search interfaces by issuing queries. One of the major challenges in crawling deep web

  10. DMQL: A Data Mining Query Language for Relational Databases Jiawei Han Yongjian Fu Wei Wang Krzysztof Koperski Osmar Zaiane

    E-Print Network [OSTI]

    Zaiane, Osmar R.

    DMQL: A Data Mining Query Language for Relational Databases Jiawei Han Yongjian Fu Wei Wang@cs.sfu.ca Abstract The emerging data mining tools and systems lead naturally to the demand of a powerful data mining. This motivates us to design a data mining query language, DMQL, for mining di erent kinds of knowledge

  11. DMQL: A Data Mining Query Language for Relational Databases \\Lambda Jiawei Han Yongjian Fu Wei Wang Krzysztof Koperski Osmar Zaiane

    E-Print Network [OSTI]

    Fu, Yongjian

    DMQL: A Data Mining Query Language for Relational Databases \\Lambda Jiawei Han Yongjian Fu Wei Wang@cs.sfu.ca Abstract The emerging data mining tools and systems lead naturally to the demand of a powerful data mining. This motivates us to design a data mining query language, DMQL, for mining different kinds of knowledge

  12. A Study of "Churn" in Tweets and Real-Time Search Queries Jimmy Lin and Gilad Mishne

    E-Print Network [OSTI]

    Daume III, Hal

    A Study of "Churn" in Tweets and Real-Time Search Queries Jimmy Lin and Gilad Mishne Twitter, Inc in the next. Informally, we call this phenomenon "churn". Our interest in analyzing churn stems from that the underlying distributions change rapidly? In this pa- per, we present an analysis of tweet and query churn

  13. Running the T&E Expense Report EX_DDR Query in PeopleSoft 8.8 Sign in to PeopleSoft

    E-Print Network [OSTI]

    Barrash, Warren

    Running the T&E Expense Report EX_DDR Query in PeopleSoft 8.8 Sign and Reports. #12;EX_DDR Query _ 02/10 Page 2 Notice that you now have may use either menu in navigating to the EX_DDR report query. If using

  14. Evaluating the LWT-MAC Performance in Query-Driven WSNs Using Data-Centric

    E-Print Network [OSTI]

    Bellalta, Boris

    Evaluating the LWT-MAC Performance in Query-Driven WSNs Using Data-Centric Routing Anna Fabra, c/ Roc Boronat 138, 08018, Barcelona, Spain anna.sfairopoulou@upf.edu Abstract. Data-centric interactions. An example of data-centric rout- ing protocol is Directed Diffusion, in which sinks disseminate

  15. Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks

    E-Print Network [OSTI]

    Wong, Raymond Chi-Wing

    , 20, 30, 33, 34] can only handle relatively small graphs due to high index construction cost and large, in terms of both querying time and indexing costs. Our empirical study shows that our method can handle unweighted scale-free graph G = (V, E), construct a disk-based index for processing This work is licensed

  16. Query Based UML Modeling Validation and Verification of the System Model and

    E-Print Network [OSTI]

    Austin, Mark

    1 Query Based UML Modeling Validation and Verification of the System Model and Behavior. UML/SysML was designed to provide simple but powerful constructs for modeling a wide range of systems for a Hydraulic Crane Denny Mathew ENPM 643 System Validation and Verification Instructor: Dr. Mark Austin Fall

  17. A Note on Query Order: Solving the Missing Case Harald Hempel \\Lambda

    E-Print Network [OSTI]

    . This solves a problem left open by previous papers in that area [HHH98a, BC]. Our results shed new light to cases that already have been considered in the literature, [HHH98a, BC], the query rounds can in the polynomial hierarchy has been studied for the first time by Hemaspaandra, Hemaspaandra, and Hempel [HHH98a

  18. Supporting Bioinformatic Experiments with A Service Query Engine Xuan Zhou Shiping Chen Athman Bouguettaya Kai Xu

    E-Print Network [OSTI]

    Xu, Kai "Kevin"

    is part of an all-encompassing system that manages the end-to-end life-cycle of services, called Web Management System (WSMS) [9]. WSMS is an all-encompassing platform that manages the end-to-end life-cycle bioinformatic experiments through service queries. We describe a real life implementation of the proposed

  19. Back to the Roots: A Probabilistic Framework for Query-Performance Prediction

    E-Print Network [OSTI]

    Kurland, Oren

    Back to the Roots: A Probabilistic Framework for Query-Performance Prediction Oren Kurland1 kurland substan- tially in their basic principles, and rely on diverse hypotheses about the characteristics with a basic question that has not been explicitly addressed in

  20. Graphical Interfaces for Racer: Querying DAML+OIL and RDF documents

    E-Print Network [OSTI]

    Haarslev, Volker

    Graphical Interfaces for Racer: Querying DAML+OIL and RDF documents Ralf M¨oller , Ronald Cornet , and Volker Haarslev§ University of Applied Sciences, Wedel Academic Medical Center ­ University application for interacting with the description logic inference server Racer. Comparing RICE with OilEd, we

  1. Optimizing Data Replication for Expanding Ring-based Queries in Wireless Sensor

    E-Print Network [OSTI]

    Krishnamachari, Bhaskar

    Optimizing Data Replication for Expanding Ring-based Queries in Wireless Sensor Networks Bhaskar. The former approach is exemplified by hash- based data centric storage techniques such as GHT [2], DIM [3 Krishnamachari and Joon Ahn Department of Electrical Engineering University of Southern California Los Angeles

  2. MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data

    E-Print Network [OSTI]

    California at Los Angeles, University of

    MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data John David N. Dionisio Alfonso F. C'ardenas Computer Science Department University of California, Los Angeles July 25 of California, Los Angeles Los Angeles, CA 90024 U.S.A. Phone: (310) 825­7550 Fax: (310) 825­2273 e

  3. MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data

    E-Print Network [OSTI]

    California at Los Angeles, University of

    MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data John David N. Dionisio Alfonso F. Cardenas Computer Science Department University of California, Los Angeles July 25 of California, Los Angeles Los Angeles, CA 90024 U.S.A. Phone: (310) 825-7550 Fax: (310) 825-2273 e

  4. An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS

    E-Print Network [OSTI]

    Leutenegger, Scott T.

    An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS Wan D. Bae systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding ex this is the first work using this approach in GIS. We investigate different sampling method- ologies and evaluate

  5. Answering Why-Not Questions on Spatial Keyword Top-k Queries

    E-Print Network [OSTI]

    Xu, Jianliang

    a top- 10 spatial query with keyword "coffee." However, surprisingly, the Starbucks cafe down the street, is not in the result. Bob wonders why the Starbucks cafe is not in the result? Are there better options? Is something be adjusted so that the Starbucks cafe, and perhaps other relevant cafes, appears on the result? Several

  6. TS-IDS Algorithm For Query Selection in the Deep Web Crawling

    E-Print Network [OSTI]

    Lu, Jianguo

    TS-IDS Algorithm For Query Selection in the Deep Web Crawling Yan Wang1 , Jianguo Lu2 , and Jessica. The deep web crawling is the process of collecting data items inside a data source hidden behind searchable of documents and terms involved, calls for new approximation algorithms for efficient deep web data crawling

  7. Guest Editorial: Special Section on Query Models and Efficient Selection of Web Services

    E-Print Network [OSTI]

    Yu, Qi

    Guest Editorial: Special Section on Query Models and Efficient Selection of Web Services Qi Yu services are poised to take center stage as part of this adoption [4]. The ever-increasing number of web services will have the effect of transforming the web from a data-oriented repository to a service

  8. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query Processing on GPUs

    E-Print Network [OSTI]

    Ailamaki, Anastassia

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query Processing on GPUs The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases CPU vs. GPU CPU (3 GHz) System Memory MB) GPU (690 MHz) 2 x 1 MB Cache The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon

  9. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query co-Processing on

    E-Print Network [OSTI]

    Ailamaki, Anastassia

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query co University of North Carolina at Chapel Hill #12;The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Superscalar Out-of-order SMT Performance *graph courtesy of Rakesh Kumar #12;The UNIVERSITY of NORTH CAROLINA

  10. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query co-Processing on

    E-Print Network [OSTI]

    Ailamaki, Anastassia

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query co University of North Carolina at Chapel Hill The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Out-of-order SMT Performance *graph courtesy of Rakesh Kumar #12;The UNIVERSITY of NORTH CAROLINA

  11. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query co-Processing on

    E-Print Network [OSTI]

    Ailamaki, Anastassia

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query co University of North Carolina at Chapel Hill The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Out-of-order SMT Performance *graph courtesy of Rakesh Kumar The UNIVERSITY of NORTH CAROLINA

  12. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query Processing on GPUs

    E-Print Network [OSTI]

    Ailamaki, Anastassia

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query Processing on GPUs The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases CPU vs. GPU CPU (3 GHz) System Memory MB) GPU (690 MHz) 2 x 1 MB Cache #12;The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon

  13. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query co-Processing on

    E-Print Network [OSTI]

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query co University of North Carolina at Chapel Hill Stavros Harizopoulos MIT #12;The UNIVERSITY of NORTH CAROLINA of Rakesh Kumar #12;The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases © A. Ailamaki

  14. The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Query Processing on GPUs

    E-Print Network [OSTI]

    Ailamaki, Anastassia

    The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases Query Processing on GPUs UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon Databases CPU vs. GPU CPU (3 GHz) System Memory MB) GPU (690 MHz) 2 x 1 MB Cache #12;The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL@Carnegie Mellon

  15. On Security of RASP Data Perturbation for Secure Half-Space Queries in the Cloud

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    On Security of RASP Data Perturbation for Secure Half-Space Queries in the Cloud ABSTRACT Secure data intensive computing in the cloud is challenging, in- volving a complicated tradeoff among security owners will not be likely to use public clouds to process their sensitive data. Secure computation

  16. Selective Dissemination of Information in P2P Systems: Data Models, Query Languages, Algorithms and

    E-Print Network [OSTI]

    Tryfonopoulos, Christos

    Selective Dissemination of Information in P2P Systems: Data Models, Query Languages, Algorithms,manolis}@intelligence.tuc.gr http://www.intelligence.tuc.gr Technical Report TR-ISL-02-2003 1 #12;Abstract Much information of interest to humans is today available on the Web. People can easily gain access to information

  17. Continuous Multi-dimensional Top-k Query Processing in Sensor Networks

    E-Print Network [OSTI]

    University of Science and Technology, China 2 Department of Computing, Hong Kong Polytechnic University, HK 3 NEC Laboratories America, Princeton, NJ 08540 4 Shenzhen Institute of Advanced Technology, Chinese of users searching information directly into the physical world, many new challenges arise for top-k query

  18. Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks

    E-Print Network [OSTI]

    Matijevic, Domagoj

    Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks Stefan Funke stations in such a way that approximately energy optimal paths can be retrieved in constant time, i. Keywords: Ad-Hoc and Sensor Networks, Routing, Power Control, Wireless LANs I. INTRODUCTION Ad hoc radio

  19. Query-driven Analysis of Plasma-based Particle Acceleration Data Oliver Rubel

    E-Print Network [OSTI]

    Query-driven Analysis of Plasma-based Particle Acceleration Data Oliver R¨ubel LBNL Cameron G. R Laboratory, e-mail: {oruebel, ewbethel}@lbl.gov Laser, Optical Accelerator System Integrated Studies (LOASIS INTRODUCTION Plasma-based particle accelerators utilize an electron plasma wave driven by a short ( 100 fs

  20. Scalable Architecture and Query Optimization for Transaction-time DBs with Evolving Schemas

    E-Print Network [OSTI]

    Zaniolo, Carlo

    UCLA zaniolo@cs.ucla.edu ABSTRACT The problem of archiving and querying the history of a database- tional technology and attribute-level-timestamping of the history of the database content, (ii) suitable is easily deployed by plugging into existing DBMS replication technologies, leading to very low overhead

  1. Decentralizing Query Processing in Sensor Networks Ross Rosemark, Wang-Chien Lee

    E-Print Network [OSTI]

    Lee, Wang-Chien

    this approach, the access point must first collect metadata from all nodes within the sensor network requir- 1 by utilizing the metadata collected from the sensor network. Such a centralized approach disallows two setsDecentralizing Query Processing in Sensor Networks Ross Rosemark, Wang-Chien Lee Department

  2. A Data Mining Query Language for Knowledge Discovery in a Geographical Information System

    E-Print Network [OSTI]

    Malerba, Donato

    ). INGENS (INductive GEographic iNformation System) is a prototype GIS which integrates data mining tools language used in INGENS, whose design is based on the standard OQL (Object Query Language). Currently georeferenced data, can be used in topographic map interpretation tasks. A prototype of GIS, named INGENS [19

  3. Ontology-Assisted Analysis of Web Queries to Determine the Knowledge Radiologists Seek

    E-Print Network [OSTI]

    Rubin, Daniel L.

    Ontology-Assisted Analysis of Web Queries to Determine the Knowledge Radiologists Seek Daniel L frequently search the Web to find informa- tion they need to improve their practice, and knowing the types of information they seek could be useful for evaluating Web resources. Our goal was to develop an automated

  4. Quete: Ontology-Based Query System for Distributed Sources Haridimos Kondylakis1,2

    E-Print Network [OSTI]

    Analyti, Anastasia

    of information sources. Our contribution is a system that provides a flexible ap- proach for integrating interconnection of diverse and large numbers of information sources. In order to provide uniform accessQuete: Ontology-Based Query System for Distributed Sources Haridimos Kondylakis1,2 , Anastasia

  5. Data Locality-Aware Query Evaluation for Big Data Analytics in Distributed Clouds

    E-Print Network [OSTI]

    Liang, Weifa

    Data Locality-Aware Query Evaluation for Big Data Analytics in Distributed Clouds Qiufen Xia, Weifa. Such data referred to as big data now becomes an invaluable asset to many businesses or organizations, as it can be used to identify business advantages by helping them make their strategic decisions. Big data

  6. Information Theoretic Bounds on Authentication Systems in Query Reihaneh Safavi-Naini Peter Wild

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Information Theoretic Bounds on Authentication Systems in Query Model Reihaneh Safavi-Naini Peter Wild School of IT and CS Information Security Group University of Wollongong Royal Holloway University Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric

  7. Information Theoretic Bounds on Authentication Systems in Query Reihaneh SafaviNaini Peter Wild

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Information Theoretic Bounds on Authentication Systems in Query Model Reihaneh Safavi­Naini Peter Wild School of IT and CS Information Security Group University of Wollongong Royal Holloway University Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric

  8. A lattice-based query system for assessing the quality of hydro-ecosystems

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A lattice-based query system for assessing the quality of hydro-ecosystems Agn`es Braud1 Cristina used for building a hierarchy of site pro- files which are annotated by hydro in the project. This paper presents an application of Galois lattices to the hydro-ecological domain, focussing

  9. AutoCor: A Query Based Automatic Acquisition of Corpora of Closely-related Languages *

    E-Print Network [OSTI]

    Builder are actually documents in other closely-related Philippine languages. AutoCor used the query generation method of closely-related Philippine languages and Tagalog. The performance of the system using with and without) like Tagalog and other Philippine languages. Unfortunately, to manually collect and organize a language

  10. Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution1

    E-Print Network [OSTI]

    Gupta, Himanshu

    . Finally, we evaluate the distributed al- gorithms using simulations and show that our approaches results-level sensing tasks in a collaborative fashion, and is periodically queried by an external source to report a summary of the sensed data/tasks. For example, a large number of sensors can be scattered in a battlefield

  11. Evaluation of Internet-Based Dengue Query Data: Google Dengue Trends

    E-Print Network [OSTI]

    Santillana, Mauricio

    Evaluation of Internet-Based Dengue Query Data: Google Dengue Trends Rebecca Tave Gluskin1 intensive and slow. As global Internet use has increased, novel, Internet-based disease monitoring tools the heterogeneity of GDT at smaller spatial scales, assessing its accuracy at the state-level in Mexico

  12. Remote sensing image segmentation by active queries Devis Tuia a,n

    E-Print Network [OSTI]

    Camps-Valls, Gustavo

    Remote sensing image segmentation by active queries Devis Tuia a,n , Jordi Mun~oz-Mari´ b , Gustavo Multiscale image segmentation Remote sensing Hyperspectral imagery Multispectral imagery a b s t r a c- istics in a compact way. For remote sensing image segmentation, the selected samples are the most

  13. Dynamical Spot Queries to Improve Specificity in P450s based Multi-Drugs Monitoring

    E-Print Network [OSTI]

    De Micheli, Giovanni

    Dynamical Spot Queries to Improve Specificity in P450s based Multi-Drugs Monitoring Sandro Carrara accurate and frequent monitoring of drugs metabolic response in living organisms during drug treatments monitoring of the patient's drug metabolism is essential as the metabolic pathways efficacy is highly

  14. People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query Logs

    E-Print Network [OSTI]

    Karahalios, Karrie G.

    People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query and Facebook2 , Menlo Park, CA 94025 {spirin2,kkarahal}@illinois.edu and {jfh,miked,maxime}@fb.com ABSTRACT Facebook in- troduced its innovative Graph Search product with the goal to take the OSN search experience

  15. Mining Association Rules of Simple Conjunctive Queries Bart Goethals Wim Le Page

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    Mining Association Rules of Simple Conjunctive Queries Bart Goethals Wim Le Page University of Antwerp, Belgium Heikki Mannila HIIT, Helsinki University of Technology University of Helsinki Abstract We present an algorithm for mining association rules in ar- bitrary relational databases. We define

  16. Don't Click Paint! Applying the Painting Metaphor to Query Interfaces and

    E-Print Network [OSTI]

    Baudisch, Patrick

    1 Don't Click ­ Paint! Applying the Painting Metaphor to Query Interfaces and Personalization techniques from paint programs can be adopted for manipulating toggle switches. A controlled experiment shows that painting can significantly speed up interfaces containing many toggle switches. To maximize time savings

  17. Plug and Play with Query Algebras: SECONDO A Generic DBMS Development Environment*

    E-Print Network [OSTI]

    Güting, Ralf Hartmut

    -order signa- ture (SOS) [Güt93]. It is reviewed in Section 3. On top of the descriptive algebra level mayPlug and Play with Query Algebras: SECONDO A Generic DBMS Development Environment* Stefan Dieker is provided by the concept of algebra modules defining and implementing new types (type constructors, in fact

  18. Plug and Play with Query Algebras: SECONDO A Generic DBMS Development Environment *

    E-Print Network [OSTI]

    Güting, Ralf Hartmut

    ­order signa­ ture (SOS) [Güt93]. It is reviewed in Section 3. On top of the descriptive algebra level mayPlug and Play with Query Algebras: SECONDO A Generic DBMS Development Environment * Stefan Dieker is provided by the concept of algebra modules defining and implementing new types (type constructors, in fact

  19. HTML-QS: A QUERY SYSTEM FOR HYPERTEXT MARKUP LANGUAGE DOCUMENTS

    E-Print Network [OSTI]

    Hamilton, Howard J.

    information centre consisting of billions of web pages. The Hyper Text Markup Language (HTML) is perhaps developed to search and query HTML web pages. Search engines such as Google can match given keywords on web structure within an HTML web page or can only present the structure at a low level. In this thesis, we

  20. Autonomic Query Parallelization using Non-dedicated Computers: An Evaluation of

    E-Print Network [OSTI]

    Paton, Norman

    Autonomic Query Parallelization using Non-dedicated Computers: An Evaluation of Adaptivity Options parallel programs that can take advantage of non-dedicated processors is much more difficult than writing such programs for networks of dedicated processors. In a non-dedicated environment such programs must use

  1. Data Stream Query Optimization Across System Boundaries of Server and Sensor Network

    E-Print Network [OSTI]

    Lindner, Wolfgang

    (SNs). Such networks may consist of small battery-powered motes with possibly lossy wireless of the motes. This paper fo- cusses on such SNs of battery-powered motes. SNQPs act as a natural data source The Borealis system [11] uses the box-and-arrow paradigm to specify the data flow. A box represents a query

  2. Metabolomic database annotations via query of elemental compositions: Mass accuracy is insufficient even at less than 1 ppm

    E-Print Network [OSTI]

    Kind, T; Fiehn, O

    2006-01-01

    and retention time index database gener- ated from plant GC/MC: Comparison of the NCI open database with seven largeOpen Access Metabolomic database annotations via query of

  3. Constraint Extraction from SQL-queries Toon Calders, Bart Goethals, and Adriana Prado

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    of Antwerp, Belgium {toon.calders, bart.goethals, adriana.prado}@ua.ac.be 1 Technical details For extracting the constraints of a given SQL-mining query, we annotate every node of a corresponding relational algebra tree is the set of virtual mining views [1] with the constraints for n {V1[1], V2[2], . . . , Vm[m]}, and O a set

  4. Computer systems and methods for the query and visualization of multidimensional database

    DOE Patents [OSTI]

    Stolte, Chris; Tang, Diane L.; Hanrahan, Patrick

    2010-05-11

    A method and system for producing graphics. A hierarchical structure of a database is determined. A visual table, comprising a plurality of panes, is constructed by providing a specification that is in a language based on the hierarchical structure of the database. In some cases, this language can include fields that are in the database schema. The database is queried to retrieve a set of tuples in accordance with the specification. A subset of the set of tuples is associated with a pane in the plurality of panes.

  5. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris; Tang, Diane L.; Hanrahan, Patrick

    2006-08-08

    A method and system for producing graphics. A hierarchical structure of a database is determined. A visual table, comprising a plurality of panes, is constructed by providing a specification that is in a language based on the hierarchical structure of the database. In some cases, this language can include fields that are in the database schema. The database is queried to retrieve a set of tuples in accordance with the specification. A subset of the set of tuples is associated with a pane in the plurality of panes.

  6. A Query-based System for Automatic Invocation of Web Services Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, Madhusudhan Govindaraju, Weiyi Meng

    E-Print Network [OSTI]

    Meng, Weiyi

    A Query-based System for Automatic Invocation of Web Services Chaitali Gupta, Rajdeep Bhowmik of XML based Web services specifications and toolkits, and provide an elegant, intuitive, simple, and powerful query based invocation system to end users. Web services based tools and standards have been

  7. Effective March 26, 2012, "Order History" in Marketplace will be replaced with "Order Query" a faster, easier way to lookup past order information.

    E-Print Network [OSTI]

    California at San Diego, University of

    Orders or Invoices. 2. What are you searching for? Enter key terms like Requisition/PO Numbers criteria entered. Filter query criteria after search is performed. In addition to the extensive Advanced, a Supplier name or a Catalog number Hint: Click "Query" for a complete list of available search terms. 3

  8. Query Routing: Finding Ways in the Maze of the Deep Web Govind Kabra Chengkai Li Kevin Chen-Chuan Chang

    E-Print Network [OSTI]

    Li, Chengkai

    Query Routing: Finding Ways in the Maze of the Deep Web Govind Kabra Chengkai Li Kevin Chen-occurrence framework for ranking and select- ing Deep Web sources that provide information relevant to users requirement. Given the huge number of heterogeneous Deep Web data sources, the end users may not know

  9. Anshuman Razdan Page 1 1/7/2002 A 3D Digital Library System: Capture, Analysis, Query, and Display

    E-Print Network [OSTI]

    Anshuman Razdan Page 1 1/7/2002 A 3D Digital Library System: Capture, Analysis, Query, and Display and results provide a model for a Digital Library of 3D data for further study and analysis. The initial focus to permit users to interact with the data using sketches or by selecting sample vessel shapes to augment

  10. Energy-efficient Search for Finite-lifetime Resources in Sensor Networks with Time-constrained Queries

    E-Print Network [OSTI]

    Kharoufeh, Jeffrey P.

    Energy-efficient Search for Finite-lifetime Resources in Sensor Networks with Time to the originating node prior to the expiration of a specific deadline. From the per- spective of energy efficiency networks when resources are subject to limited lifetimes and queries are constrained by application

  11. Probabilistic Inductive Querying Using ProbLog Luc De Raedt, Angelika Kimmig, Bernd Gutmann, Kristian Kersting, Vitor Santos

    E-Print Network [OSTI]

    Toivonen, Hannu

    be applied to the mining of large biological networks. 10.1 Introduction In recent years, both probabilistic integration of data mining primitives in database query languages. Despite the current interest in these types of Computer Science Katholieke Universiteit Leuven, Belgium e-mail: {firstname

  12. arXiv:1410.4801v1[cs.LO]17Oct2014 Percentile Queries in Multi-Dimensional Markov Decision

    E-Print Network [OSTI]

    Doyen, Laurent

    , at the same time, minimizes the energy consumption of the system. Second, there are works that aim within d time units exceeds 50 #12;percent: this is a single-constraint percentile query. With a multi

  13. The clouds of physics and Einstein's last query: Can quantum mechanics be derived from general relativity?

    E-Print Network [OSTI]

    Friedwardt Winterberg

    2008-05-20

    Towards the end of the 19th century, Kelvin pronounced as the "clouds of physics" 1) the failure of the Michelson-Morely experiment to detect an ether wind, 2) the violation of the classical mechanical equipartition theorem in statistical thermodynamics. And he believed that the removal of these clouds would bring physics to an end. But as we know, the removal of these clouds led to the two great breakthoughts of modern physics: 1) The theory of relativity, and 2) to quantum mechanics. Towards the end of the 20th century more clouds of physics became apparent. They are 1) the riddle of quantum gravity, 2) the superluminal quantum correlations, 3) the small cosmological constant. Furthermore, there is the riddle of dark energy making up 70% of the physical universe, the non-baryonic cold dark matter making up 26% and the very small initial entropy of the universe. An attempt is made to explain the importance of these clouds for the future of physics. Conjectures for a possible solution are presented. they have to do with Einstein's last query: "Can quantum mechanics be derived general relativity", and with the question is there an ether?

  14. 6/19/2007 Copyright 2007 by Benjamin Grosof. All Rights Reserved The New Rules of Business

    E-Print Network [OSTI]

    's, workflows. 1. Relational databases, SQL: Views, queries, facts are all rules. · XQuery, SPARQL emerging. SQL

  15. Following is a collection of web links that provide information on Microsoft Access, Structured Query Language (SQL), and databases in general. This list does not serve as an endorsement of

    E-Print Network [OSTI]

    Query Language (SQL), and databases in general. This list does not serve as an endorsement of any&Go.y=0&Go=Go Structured Query Language (SQL) Links SQLCourse ­ Interactive Online SQL Training for Beginners http://sqlcourse.com/ "This unique introductory SQL tutorial not only provides easy

  16. Xerox Palo Alto Research Center Technical Report P2001-10113, May 2001. Revised July 25, 2001. Scalable Information-Driven Sensor Querying and Routing for ad hoc

    E-Print Network [OSTI]

    Zhao, Feng

    battery power, frequent node attrition, and variable data and communication quality. To scale up, California 94304, U.S.A. Abstract This paper describes two novel techniques, information-driven sensor that the information-driven querying and routing techniques are more energy efficient, have lower detection latency

  17. arXiv:1109.2425v1[cs.DC]12Sep2011 Query processing in distributed, taxonomy-based information

    E-Print Network [OSTI]

    Analyti, Anastasia

    to a local vocabulary. The objects may be a category of commercial items, such as cars, and a source mayarXiv:1109.2425v1[cs.DC]12Sep2011 Query processing in distributed, taxonomy-based information sources Carlo Meghini Yannis Tzitzikas Veronica Coltella Anastasia Analyti§ Abstract We address

  18. Ontology-based Annotation and Query of Tissue Microarray Data Nigam H. Shah, Daniel L. Rubin, Kaustubh S. Supekar and Mark A. Musen

    E-Print Network [OSTI]

    Rubin, Daniel L.

    Ontology-based Annotation and Query of Tissue Microarray Data Nigam H. Shah, Daniel L. Rubin from both ontologies, providing the potential to align the two ontologies based on experimental data) is a repository of data amassed by a consortium of pathologists and biomedical researchers. The TMAD data

  19. Cataloguer makeover 

    E-Print Network [OSTI]

    Ilik, Violeta

    2014-02-28

    Language (OWL) Available tools: Relational data – RDF data SQL query language ? relational data SPARQL query language ? RDF data “SQL does this by accessing tables in relational databases, and SPARQL does this by accessing a web of Linked Data...

  20. Architecture Query processing

    E-Print Network [OSTI]

    Ghelli, Giorgio

    BirthYear Subject Grade Univ 1234567 Mary Pisa Tuscany 1995 DB 30 Pisa 1234567 Mary Pisa Tuscany 1995 SE 28 Pisa 1234568 John Lucca Tuscany 1994 DB 30 Pisa 1234568 John Lucca Tuscany 1994 SE 28 Pisa · Stud

  1. SPARQL SAHA, a Configurable Linked Data Editor and Browser as a Service

    E-Print Network [OSTI]

    Hyvönen, Eero

    SPARQL SAHA, a Configurable Linked Data Editor and Browser as a Service Eetu Mäkelä and Eero first.last@aalto.fi, http://www.seco.tkk.fi/ Abstract. SPARQL SAHA is a linked data editor and browser it was deduced that the SPARQL SAHA linked data editor and browser presented in this paper still has a particular

  2. Selectivity Estimation for SPARQL Graph Pattern Faculty of ICT

    E-Print Network [OSTI]

    Liu, Chengfei

    , for an arbitrary composite SPARQL graph pattern, we maximally combines the results of the star and chain patterns with different properties sharing the same subject (an example is shown in Figure 1). For estimating' Income 'Prof.' Position 'Advance d course' (Adc) TeacherOf ?Z, Income, '

  3. Service-oriented Continuous Query

    E-Print Network [OSTI]

    Wolf, Christian

    sans-fil Zigbee - Capteurs et I/O programmables variés · 40 modules électroniques programmables à la Zigbee - Support de Contiki OS - Capteurs et I/O programmables variés Site web de la plateforme http

  4. Service-oriented Continuous Query

    E-Print Network [OSTI]

    Wolf, Christian

    -fil programmable en Java (SunSPOT / Oracle) - Java VM native - communication sans-fil Zigbee - capteurs et I Systems) - CPU MSP430-5 - communication sans-fil 6LoWPAN ou Zigbee - support de Contiki OS - capteurs et I

  5. Evaluation of Anonymized ONS Queries

    E-Print Network [OSTI]

    Garcia-Alfaro, Joaquin; Kranakis, Evangelos

    2009-01-01

    Electronic Product Code (EPC) is the basis of a pervasive infrastructure for the automatic identification of objects on supply chain applications (e.g., pharmaceutical or military applications). This infrastructure relies on the use of the (1) Radio Frequency Identification (RFID) technology to tag objects in motion and (2) distributed services providing information about objects via the Internet. A lookup service, called the Object Name Service (ONS) and based on the use of the Domain Name System (DNS), can be publicly accessed by EPC applications looking for information associated with tagged objects. Privacy issues may affect corporate infrastructures based on EPC technologies if their lookup service is not properly protected. A possible solution to mitigate these issues is the use of online anonymity. We present an evaluation experiment that compares the of use of Tor (The second generation Onion Router) on a global ONS/DNS setup, with respect to benefits, limitations, and latency.

  6. XML Query Languages Martin Steffen

    E-Print Network [OSTI]

    Steffen, Martin

    al., 2007] #12;XML-data = trees Joe Doe doe> #12;XML-data = trees Joe Doe doe@cba.org ;XML-data = trees Joe Doe doe@cba.org

  7. Author Query Form Article ID

    E-Print Network [OSTI]

    Sun, Dengfeng

    service capacity optimization for both electric power suppliers and independent system operator Copyright capacity optimization problems for both Market participants (MP) and Independent System Operator (ISO). For a market participant, the firm needs to determine the capacity allocation plan for various AS to pursue

  8. Query by Document Computer Science

    E-Print Network [OSTI]

    Papadias, Dimitris

    such as blogs, social networking sites and micro- blogging services. Such abundance of content complements con across textual services. For example, commonly we read a news item and we wonder if there are any blogs including information produced on web pages, infor- mation on blogs and social networking sites or micro-blogging

  9. Example Queries | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTIONRobertsdale, AlabamaETEC GmbH JumpEllenville,PowerEvaporative Coolers Jumpin

  10. Complex Queries | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX E LISTStar EnergyLawler,Coal TechnologiesClioCommunityLtd JumpAntasCompareCompiling

  11. EIA-176 Query System 2008

    Gasoline and Diesel Fuel Update (EIA)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming Dry NaturalPrices1Markets 9, 3:00Markets 26, 4:00Markets 9,5

  12. User:Woodjr/Sandbox/Sparql2 | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION JEnvironmental Jump to:EA EISTJThin FilmUnited States:User pageSandbox/Sparql2 < User:Woodjr‎

  13. User:Woodjr/Sandbox/Sparql3 | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION JEnvironmental Jump to:EA EISTJThin FilmUnited States:User pageSandbox/Sparql2 <

  14. User:Woodjr/Sandbox/Sparql4 | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION JEnvironmental Jump to:EA EISTJThin FilmUnited States:User pageSandbox/Sparql2 <source History

  15. Exponential Communication Ine ciency of Demand Queries

    E-Print Network [OSTI]

    Sandholm, Tuomas W.

    FORECAST COMBINATION IN REVENUE MANAGEMENT DEMAND FORECASTING SILVIA RIEDEL A thesissubmitted Combination in RevenueManagement Demand Forecasting Abstract The domain of multi level forecastcombination

  16. Query-based debugging of distributed systems

    E-Print Network [OSTI]

    Braud, Ryan Evans

    2010-01-01

    its relation to software testing, and its close ties withsomehow be discovered. Software testing, or just testing, is

  17. Scalable Query Dissemination in XPeer Giovanni Conforti

    E-Print Network [OSTI]

    Ghelli, Giorgio

    `a di Pisa Largo B. Pontecorvo 3 - 56127 Pisa - Italy confor@di.unipi.it Giorgio Ghelli Dipartimento di Informatica - Universit`a di Pisa Largo B. Pontecorvo 3 - 56127 Pisa - Italy ghelli@di.unipi.it Paolo Manghi ISTI - CNR via G. Moruzzi 1 - 56124 Pisa - Italy paolo.manghi@isti.cnr.it Carlo Sartiani Dipartimento

  18. Concurrent Secure Computation with Optimal Query Complexity

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    and design concurrently secure protocols kicked into gear with early works such as [GK96, DDN00a], Boston

  19. Evaluating Trajectory Queries Over Imprecise Location Data

    E-Print Network [OSTI]

    Yiu, Man Lung

    Aalborg University, Denmark xkxie@cs.aau.dk 2 University of Hong Kong, Pokfulam Road, Hong Kong ckcheng to hardware limitations of measuring devices, as well as the constantly-changing nature of the external-based service (LBS in short), such as "what is the nearest gas station along the travel route". Unfortunately

  20. Page 1 of 1 Author Query Form

    E-Print Network [OSTI]

    Utsunomiya, Satoshi

    ;A/Author phone: C;A/Title C;A/Department Department of Nuclear Engineering and Radiological Sciences C 48109-2104 C;A/Country U.S.A. C;A/Title C;A/Department Department of Nuclear Engineering, and Nuclear Engineering and Radiological Science C;A/Institution University of Michigan C;A/Street Address

  1. A Declarative Query Approach to Object Identification

    E-Print Network [OSTI]

    Gogolla, Martin - Fachbereich 3

    partially supported by the CEC under Grant No. 6112 (COMPASS). #12; object identity from the data type point properties `Name' and `Pop' (for population), rivers also have a `Name' and a `Length' of flow. Towns possess

  2. Query Generation From Multiple Media Examples

    E-Print Network [OSTI]

    Ren, R.

    Ren,R. Jose,J.M. the 7th International Workshop on Content-Based Multimedia Indexing pp 138-143 IEEE Computer Society Press

  3. Efficient Computation of Multiple XML Keyword Queries

    E-Print Network [OSTI]

    Liu, Chengfei

    to the structure and rich semantics of XML data. As such, a family of LCA (Low- est Common Ancestor) based approaches have been proposed, such as, SLCA (Smallest LCA)[12,9] and ELCA (Exclusive LCA)[5,13,15]. We

  4. On Cartesian Trees and Range Minimum Queries

    E-Print Network [OSTI]

    Demaine, Erik

    between RMQ and the Lowest Common Ancestor (LCA) problem. In LCA, we wish to preprocess a rooted tree and LCA were shown by Gabowet al. [18] to be equivalent in the sense that either one can be reduced in linear time to the other. An LCA instance can be obtained from an RMQ instance on an array A by letting

  5. Relational Database SQL: Querying the Relational DB

    E-Print Network [OSTI]

    Qiu, Weigang

    Standards and Dialects ISO SQL:2008 DBMS vendors offer their own extensions Oracle PostgreSQL MySQL Weigang: auto-completion and command history Weigang Qiu Relational Database & SQL #12;Relational Database SQL

  6. Query Processing on Temporally Evolving Social Data

    E-Print Network [OSTI]

    Huo, Wenyu

    2013-01-01

    Zaniolo. Graceful Database Schema Evolution. In VLDB, C. A.Transaction-time Databases under Schema Evolution. In VLDB,Time Databases under Branched Schema Evolution. In DEXA,

  7. Enabling Geographical Queries to a Botanical Database 

    E-Print Network [OSTI]

    Sato, Go

    2011-11-25

    Conservation of the lowland savanna ecosystem in Belize Project (Defra 17-022) has created a database of savanna plant collections in the country. Some of the collections have accurate positional coordinates measured by GPS devices while the others...

  8. Query-based debugging of distributed systems

    E-Print Network [OSTI]

    Braud, Ryan Evans

    2010-01-01

    3.2.1 Why Not SQL? . . . . . 3.2.2 N Y QL Fundamentals . .What’s New for XML in SQL Server 2008. http://www.microsoft.com/sqlserver/2008/en/us/wp-sql-2008-whats-new-xml.aspx. [

  9. Relational Queries over Interpreted Structures Michael Benedikt

    E-Print Network [OSTI]

    Libkin, Leonid

    Naperville, IL 60566-7050, USA Email: benedikt@bell-labs.com Leonid Libkin Bell Laboratories 600 Mountain

  10. Beyond Simple Aggregates: Indexing for Summary Queries

    E-Print Network [OSTI]

    Yi, Ke "Kevin"

    .04.07 Japan nuclear crisis 2011.04.07 Libya · · · 2011.03.11 Japan earthquake 2011.03.11 Japan tsunami 2011 2011.03.11 Japan tsunami 2011.03.10 NCAA · · · Keyword Frequency Libya 19.3% Japan nuclear crisis 16 2011.04.08 Libya 2011.04.07 Japan nuclear crisis 2011.04.07 Libya · · · 2011.03.11 Japan earthquake

  11. Scale-Independent Relational Query Processing

    E-Print Network [OSTI]

    Armbrust, Michael Paul

    2013-01-01

    Objectives . . NoSQL Storage Systems . . . . . . 2.5.1 DataBigtable: A Distributed Storage System for Structured Data”.and more. These storage systems provide developers with a

  12. Querying Uncertain Data in Resource Constrained Settings

    E-Print Network [OSTI]

    Meliou, Alexandra

    2009-01-01

    of algorithms and components in a WSN, and researchers haveIn this thesis, we address WSN energy efficiency –and hencemost fundamental tasks in a WSN, and the execution of those

  13. Query Answering in Data Integration Systems

    E-Print Network [OSTI]

    Salloum, Mariam

    2011-01-01

    These vari- ables, called K-pos variables, express theas defined below. Definition 2.3. (K-pos Variable:) Ak-positive (k-pos) variable denotes a variable which

  14. Query-Based Debugging UNIVERSITY OF CALIFORNIA

    E-Print Network [OSTI]

    Hölzle, Urs

    and El Nino. My main influence outside the UCSB walls was the keen-eyed teaching of Dae Soen Sa Nim (Zen

  15. Automatic Query Reformulation Based on Divergence

    E-Print Network [OSTI]

    Cai, D.

    Cai,D. van Rijsbergen,C.J. Jose,J.M. Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM) editors: Pagues, H. Liu, L., and Grossman, D. pp 419-426 ACM

  16. Automatic Query Expansion Based on Directed Divergence

    E-Print Network [OSTI]

    Cai, D.

    Cai,D. Van Rijsbergen,C.J. The Proceedings of the 10th International Conference on Information Technology: Coding and Computing (ITCC) pp 8--15

  17. ONLINE QUERY PROCESSING IN GEOGRAPHIC INFORMATION

    E-Print Network [OSTI]

    Bae, Wan

    of Philosophy Professor in charge of dissertation Vice Provost for Graduate Studies Date #12;Contents Contents") . . . . . . . . . . . . . . . . . . . . . . . 34 3.3.2 IRS Js ("s" for "stratified") . . . . . . . . . . . . . . . . . . . . . 35 3.3.3 IRS Jp ("p) . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 4.4 Incremental Stratified Sampling Join (IS S J) . . . . . . . . . . . . .

  18. Table Name query? | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page| Open Energy Information Serbia-Enhancing CapacityVectren)Model forTechnologies95Symerton,E CTEPTTP Plc Jump

  19. compound queries | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX ECoop IncIowa (UtilityMichigan) JumpZhuyuanWindeyZibobuildingcitiescommunity solar

  20. OpenEI Community - ask queries

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIXsourceII JumpQuarterly Smart Grid Data available for download onst,/0 en Big CleanGRR 3rd

  1. OpenEI Community - compound queries

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIXsourceII JumpQuarterly Smart Grid Data available for download onst,/0 en BigArt

  2. Natural Gas Annual Respondent Query System

    Gasoline and Diesel Fuel Update (EIA)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming Dry NaturalPrices1Markets See(STEO),7F e b r61-£661.loading new

  3. Geospatial Semantics for Topographic Data

    E-Print Network [OSTI]

    Usery, Lynn

    2013-01-24

    )) } } This query selects all of the features that overlap the Sentinel quad, including itself. 52 53 54 Environmental and Other Thematic Maps We will search for EPA sites within 5 km of Pittsburg Firehouse near Sentinel. 55 GeoSPARQL Query to Connect EPA...)) } } This query selects all of the features that overlap the Sentinel quad, including itself. 52 53 54 Environmental and Other Thematic Maps We will search for EPA sites within 5 km of Pittsburg Firehouse near Sentinel. 55 GeoSPARQL Query to Connect EPA...

  4. Graph Mining Meets the Semantic Web

    SciTech Connect (OSTI)

    Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

  5. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets...

    Office of Scientific and Technical Information (OSTI)

    data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they...

  6. Extending Query Languages for In-Network Query George Valkanas, Dimitrios Gunopulos

    E-Print Network [OSTI]

    Fernandes, Alvaro A. A.

    us to deploy large-scale networks of sensing devices, as their cost also decreases over time. However, low cost imposes resource limitations on the nodes and introduces challenges for data collection to human activities (e.g. fluid flow, wind etc). An- other interesting aspect of such networks

  7. Generation of query-biased concepts using content and structure for query reformulation

    E-Print Network [OSTI]

    Chang, Y-J.; Wang, J.; Lalmas, M.

    Chang,Y-J. Wang,J. Lalmas,M. 13th International Conference on Applications of Natural Language to Information Systems (NLDB2008), London pp 136-141 LNCS, Springer

  8. SSB Training: SSB Basic Querying Tools Self Service Banner Finance Queries for Grants/Sponsored Research

    E-Print Network [OSTI]

    Service Banner (SSB) SSB is accessed through the CSM web portal "Trailhead". To login, follow these steps

  9. Towards Query Formulation and Query-Driven Ontology Extensions in OBDA Systems

    E-Print Network [OSTI]

    Grau, Bernardo Cuenca

    ; and it is spread over a vast variety of formats and sources, being mod- eled using different conceptualisations several iterations. In particular in the oil and gas industry, IT-experts spend 30­70% of their time at solutions that significantly reduce the cost of data access. 5 Statoil ASA is an oil and gas company

  10. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfate Reducing(Journal Article)lasers (Journal Article) |different scales (Journal Article) |

  11. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfate Reducing(Journal Article)lasers (Journal Article) |different scales (Journal Article) |Bitmap

  12. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfate Reducing(Journal Article)lasers (Journal Article) |different scales (Journal Article)

  13. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfate Reducing(Journal Article)lasers (Journal Article) |different scales (Journal Article)Bitmap

  14. Developing Registries for the Semantic Sensor Web using stRDF and stSPARQL (short paper)

    E-Print Network [OSTI]

    Koubarakis, Manolis

    for the problem at hand, since spatial and temporal metadata figure prominently in the description of sensorsDeveloping Registries for the Semantic Sensor Web using stRDF and stSPARQL (short paper) Kostis of registering and discovering sen- sors, sensor services and other related resources in the Semantic Sensor Web

  15. Massive-scale RDF Processing Using Compressed Bitmap Indexes

    SciTech Connect (OSTI)

    Madduri, Kamesh; Wu, Kesheng

    2011-05-26

    The Resource Description Framework (RDF) is a popular data model for representing linked data sets arising from the web, as well as large scienti#12;c data repositories such as UniProt. RDF data intrinsically represents a labeled and directed multi-graph. SPARQL is a query language for RDF that expresses subgraph pattern-#12;nding queries on this implicit multigraph in a SQL- like syntax. SPARQL queries generate complex intermediate join queries; to compute these joins e#14;ciently, we propose a new strategy based on bitmap indexes. We store the RDF data in column-oriented structures as compressed bitmaps along with two dictionaries. This paper makes three new contributions. (i) We present an e#14;cient parallel strategy for parsing the raw RDF data, building dictionaries of unique entities, and creating compressed bitmap indexes of the data. (ii) We utilize the constructed bitmap indexes to e#14;ciently answer SPARQL queries, simplifying the join evaluations. (iii) To quantify the performance impact of using bitmap indexes, we compare our approach to the state-of-the-art triple-store RDF-3X. We #12;nd that our bitmap index-based approach to answering queries is up to an order of magnitude faster for a variety of SPARQL queries, on gigascale RDF data sets.

  16. arXiv:1503.00301v1[cs.DB]1Mar2015 On Defining SPARQL with Boolean Tensor Algebra

    E-Print Network [OSTI]

    Waldmann, Uwe

    arXiv:1503.00301v1[cs.DB]1Mar2015 On Defining SPARQL with Boolean Tensor Algebra Saskia Metzler Max-case calligraphic letters (T ). Element (i, j, k) of a 3-way tensor X is denoted as xijk. A colon in a subscript

  17. Query-based Data Warehousing Tool Rami Rifaieh

    E-Print Network [OSTI]

    Song, Il-Yeol

    between the source and the target data. Thus, we allow DBMS to play an expanded role as a data to provide evolution is a hard task and time consuming. In order to simplify this task, a full implementation allow DBMS to play an expanded role as a data transformation engine as well as a data store. Therefore

  18. Authors Queries Journal: International Journal of Remote Sensing

    E-Print Network [OSTI]

    Texas at San Antonio, University of

    and Environmental Science, New Mexico Tech, Socorro, NM 87801, USA §Laboratory for Remote Sensing and Geoinformatics

  19. Adaptive information filtering through automatic Boolean query generation 

    E-Print Network [OSTI]

    Nichols, Michael Roddy

    1998-01-01

    The subject of this thesis is the development and graphics. testing of a new algorithm for intelligently altering information content on the World Wide Web and in other similar domains. The approach described in this thesis is a hybrid algorithm...

  20. Fault-Tolerant Queries over Sensor Data Iosif Lazaridis1

    E-Print Network [OSTI]

    Venkatasubramanian, Nalini

    -generated values in the presence of faults. Small sensors are fragile, have fi- nite energy and memory demon- strate the good performance of FATE-CSQ compared to competing protocols with realistic simulation, thus im- proving reaction times, (iii) preserving the crucial re- sources of wireless bandwidth

  1. Data Analysis and Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chatzimilioudis, Georgios

    2010-01-01

    138, New York, NY, USA, 2004. ACM. [190] ZigBee-Alliance.Zigbee speci?cation.ZigBee Document 053474r06, Version 1.0,

  2. Optimizing Path Query Performance: Graph Clustering Strategies \\Lambda

    E-Print Network [OSTI]

    information systems, fleet management, public transit, troop movement, urban planning, to name a few. Among energy­efficient path from A to B that does not use toll roads.'' Q2: ``Display all the garages reachable

  3. Consumer Query Health Profile Saint Alphonsus Regional Medical Center

    E-Print Network [OSTI]

    Barrash, Warren

    .0% Diabetes 36.0% 50.4% 38.7% 42.6% Osteoporosis 19.2% 18.7% 14.5% 10.1% Total Cholesterol (>200) NA NA NA 42

  4. Monitoring the Dynamic Web to respond to Continuous Queries

    E-Print Network [OSTI]

    Chakrabarti, Soumen

    and Engineering Indian Institute of Technology Powai, Mumbai-400076, India pandey@cse.iitb.ac.in Krithi Ramamritham Computer Science and Engineering Indian Institute of Technology Powai, Mumbai-400076, India krithi@cse.iitb.ac.in Soumen Chakrabarti Computer Science and Engineering Indian Institute of Technology Powai, Mumbai-400076

  5. Query Processing in Mobile Sensor Networks Wang-Chien Lee

    E-Print Network [OSTI]

    Lee, Wang-Chien

    , a sensor network for air pollution test, where all sensors are scattered in the air and transported to collect the data from the sensors about air pollution and traffic conditions. In comparison, vehicles, animals, air, and water). With self-propelling sensor nodes, a mobile sensor network is self

  6. Mining Transliterations from Web Query Results: An Incremental Approach

    E-Print Network [OSTI]

    We study an adaptive learning framework for phonetic similarity modeling (PSM) that supports strategy for the framework based on Bayesian theory for PSM adaptation. The idea of incremental learning reality. In this way, the learning process refines the PSM incrementally while constructing

  7. Scalable Evaluation of Trajectory Queries over Imprecise Location Data

    E-Print Network [OSTI]

    Yiu, Man Lung

    . Such threats are exemplified by volcanic ashes for flights in North Europe [1] and icebergs for vessels in US. Such technologies usually work at low sensing frequency because of cost constraints, and thus render the measured-mail: ckcheng@cs.hku.hk (volcanic ashes) can move depending on the ocean current (wind) speed. In the pipeline

  8. Querying Provenance Information in Distributed Environments Jing Zhao*, Yogesh Simmhan

    E-Print Network [OSTI]

    Hwang, Kai

    Science Department, ¶ Ming Hsieh Dept. of Electrical Engineering University of Southern California, Los, a meteorology project may collect provenance about weather measurements and forecast models within a single provenance repository shared by that collaboration, while a smart power grid workflow that makes city

  9. Aqua: A Fast Decision Support System Using Approximate Query Answers

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    commercial relational DBMS. Aqua precomputes synopses (special sta- tistical summaries) of the original data and stores them in the DBMS. It provides approximate an- swers (with quality guarantees) by rewriting on top of any SQL- compliant DBMS managing a data warehouse. Aqua pre- computes statistical summaries

  10. Parallel Query Support for Multidimensional Data: Inter-object Parallelism

    E-Print Network [OSTI]

    Baumann, Peter

    array database management systems. It discusses their implementation in the RasDaMan DBMS, the first DBMS for generic mul- tidimensional array data. The efficiency of the techniques presented is demon) into Data- base Management Systems (DBMS) has received growing attention. Current scientific contributions

  11. Managing and Querying Transaction-time Databases under Schema Evolution

    E-Print Network [OSTI]

    Zaniolo, Carlo

    problem of managing the history of database in- formation is now made more urgent and complex by fast by intro- ducing two key pieces of new technology. The first is a method for publishing the history evolution history. 1. INTRODUCTION The ability of archiving past database information and supporting

  12. Coordination through Querying in the Youtopia System [Demonstration paper

    E-Print Network [OSTI]

    first attempt at implementing this vision. Youtopia provides coordination abstractions within the DBMS 1. INTRODUCTION In the long history of humankind (and animal kind, too) those who learned the DBMS, freeing the developers of the travel website from the burden of implementing it in the middle

  13. March 23, 2008 Databases: SQL 1 Structured Query Language -SQL

    E-Print Network [OSTI]

    Adam, Salah

    , 2008 Databases: SQL 5 - Introduction Objectives of SQL + History of SQL + Importance of SQL;March 23, 2008 Databases: SQL 9 -- History of SQL ... In 1974, D. Chamberlin (IBM San Jose Laboratory-quel', though official pronunciation is 's-q-l'. IBM subsequently produced a prototype DBMS called System R

  14. Database System Architecture Supporting Coexisting Query Languages and Data Models 

    E-Print Network [OSTI]

    Hepp, Pedro E.

    1983-01-01

    Database technology is already recognised and increasingly used in administering and organising large bodies of data and as an aid in developing software. This thesis considers the applicability of this technology in ...

  15. Modeling and Querying Vague Spatial Objects Using Shapelets

    E-Print Network [OSTI]

    Gertz, Michael

    that provide building blocks for versatile high-level operations on vague spatial objects. In addition, we Endowment, ACM 978-1-59593-649-3/07/09. localized and have metadata that should be associated with distinct objects, such as agricultural chemical applications, sensor coverage maps, and vegetation levels. Together

  16. Modeling and Querying Vague Spatial Objects Using Shapelets

    E-Print Network [OSTI]

    Gertz, Michael

    - prehensive set of low-level operations that provide building blocks for versatile high-level operations metadata that should be associated with distinct objects, such as agricultural chemical applications, #12;sensor coverage maps, and vegetation levels. Together, modeling such real-world phenomena motivates a new

  17. Fast Approximate Evaluation of OLAP Queries for Integrated Statistical Data

    E-Print Network [OSTI]

    Shahabi, Cyrus

    obtaining fast responses. In the Energy Data Collection (EDC) at the Digital Government Research Center (DGRC) we are ad- dressing these types of information integration problems. The Energy Data Collection project is building an integration system for accessing and disseminating energy data from sources

  18. Varying Approaches to Topical Web Query Classification Steven M. Beitzel

    E-Print Network [OSTI]

    Chowdhury, Ophir Frieder Information Retrieval Laboratory Illinois Institute of Technology Chicago, IL 60616 a classifier trained using a document taxonomy. Bridging classifiers map the categories of a document taxonomy classifier which requires snippets from retrieved documents. Categories and Subject Descriptors H.3

  19. Dynamaps: Dynamic Queries on a Health Statistics Atlas

    E-Print Network [OSTI]

    Golbeck, Jennifer

    and running on their ordinary staff equipment, a thematic map of the United States is animated by moving color coded for each state (e.g. the Cervix Uteri cancer rate [figure 1]). The states where the cancer rate is high are red (dark on the figure), the states where the rates are low appear blue and the other

  20. FACILITATING DATA EXPLORATION: DYNAMIC QUERIES ON A HEALTH STATISTICS MAP

    E-Print Network [OSTI]

    Golbeck, Jennifer

    . A thematic map of the United States is animated by adjusting sliders displayed on the side of the map. A time.g. proposing that a demographic factor might be linked to a cause of death.) More recently thematic maps helped in order to access the exact rate in an area. Research on map graphic design (e.g.. [2]) shows that careful

  1. Data Analysis and Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chatzimilioudis, Georgios

    2010-01-01

    multicasting in energy-constrained wireless networks. IEEEdesign for energy-e?cient wireless sensor networks. Inenergy and maximizing network lifetime multicasting in wireless

  2. Enriching queries using argumentation: an industrial application of argumentation

    E-Print Network [OSTI]

    Croitoru, Madalina

    expressed by the involved parties (food and packaging industries, health and waste management etc, food industry, packaging industry, waste management policy, etc.) requirements expressed as simple BIOdegradable Composite Advanced Packaging), aiming at conceiving the next generation of food packagings, we

  3. Conflicting Viewpoint Relational Database Querying: an Argumentation Approach

    E-Print Network [OSTI]

    Croitoru, Madalina

    by the involved parties (food and packaging industries, health authorities, consumers, waste management authority EcoBioCap, we model a real world use case aiming at conceiving the next generation of food packagings genera- tion packagings using advanced composite structures based on constituents derived from the food

  4. Data Analysis and Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chatzimilioudis, Georgios

    2010-01-01

    6.3 GIG [3] is not an optimal algorithm.An example where GIG misses the optimal operator placement (named “Greedy is Good” (GIG) [3] propose a decentralized

  5. Detecting the Temporal Context of Queries Oliver Kennedy1

    E-Print Network [OSTI]

    is loaded into the analytical warehouse. For example when an ETL process aggregates data, individual values benefit from contextual analysis. Contextual Dependence Errors in ETL Processes. Extract, Tranform, Load are lost and an outlier might skew the results in a misleading way. As a consequence, end-users who

  6. Data Analysis and Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chatzimilioudis, Georgios

    2010-01-01

    sensor nodes that collect and Figure 1.2: Energy harvesting for battery-less nodes report data on temperature, humidity, wind

  7. An Efficient Approach to Support Querying Secure Outsourced XML Information

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    and Technology {yini, wilfred, lauhl, csjames}@cs.ust.hk Abstract. Data security is well-recognized a vital issue encrypted XML. XQEnc is based on two important techniques of vectorization and skele- ton compression. Essentially, vectorization, which is a generalization of columns of a relational table, makes use the basic

  8. Towards Elastic Transactional Cloud Storage with Range Query Support

    E-Print Network [OSTI]

    Ooi, Beng Chin

    storage that can elastically scale on- demand with minimal startup cost. In this paper, we propose ecStore ­ an elastic cloud storage sys- tem that supports automated data partitioning and replication, load balancing with a replication layer in the middle and a transaction management layer on top. ecStore pro- vides adaptive read

  9. Data Analysis and Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chatzimilioudis, Georgios

    2010-01-01

    monitoring application [167], a WSN application that greatlyhardware advances that made WSN possible, a great amount ofTo the versatility of the WSN adds the ability to deploy

  10. Answering EL Queries in the Presence of Preferences

    E-Print Network [OSTI]

    Baader, Franz

    is a func- tion Pos : [0, 1] that intuitively provides a degree of how possible is an event to happen. This function is extended to sets by defining Pos() = sup Pos(). The product conditional distribution which is defined by the equation Pos( ) = Pos( | ) · Pos(). Possibilistic networks decompose a possibility

  11. Pathfinder: A Relational Query Optimizer Explores XQuery Terrain

    E-Print Network [OSTI]

    Teubner, Jens

    :outer, pos:pos1, item) ROW# (pos1:pos>/outer) |X| (iter = inner) @ (pos), val: #1 ¶ (outer:iter, sort:pos, inner) ROOTS NUMBER (inner) ELEM (iter, item:pos, item>) ELEM_TAG @ (item), val: item ¶ (iter, pos:pos1, item) @ (pos), val: #1 ROW# (pos1:pos>/iter) ¶ (iter) @ (pos), val: #1 ¶ (iter

  12. Querying Large Text Databases for Efficient Information Extraction

    E-Print Network [OSTI]

    cartridge", "printer cartridge", "www.greatcartridges.com", "it lacked two of the three colors problematic retailers or products). 1 #12;[...] When I purchased four inkjet cartridges (two black and two.greatcartridges.com after receiving the cartridges, [...]. My second mistake was not to try the color cartridges when I

  13. Querying Large Text Databases for Efficient Information Extraction

    E-Print Network [OSTI]

    cartridge'', ``printer cartridge'', ``www.greatcartridges.com'', ``it lacked two of the three problematic retailers or products). 1 #12; [. . . ] When I purchased four inkjet cartridges (two black and two.greatcartridges.com after receiving the cartridges, [. . . ]. My second mistake was not to try the color cartridges when I

  14. Querying Faceted Databases Columbia University Technical Report CUCS01303

    E-Print Network [OSTI]

    to subjects in sequence, but uses clearly defined, mutually exclusive, and col­ lectively exhaustive aspects are called facets of a class or subject, a term introduced into clas­ sification theory and given this new of entities. Our language has linear data complexity in terms of space and quadratic data complexity in terms

  15. Demo Paper: Querying Geospatial Data Streams in SECONDO Chengyang Zhang

    E-Print Network [OSTI]

    Huang, Yan

    interface for dynamic visualization of steaming results. Categories and Subject Descriptors H.2 within 10 miles of a flooding zone (region geo-stream)" or "Continuously find a route (line geo-driven web interface for dynamic visualization of steaming results. 2. SYSTEM ARCHITECTURE We set out

  16. Improving Estimation Accuracy of Aggregate Queries on Data Cubes

    SciTech Connect (OSTI)

    Pourabbas, Elaheh; Shoshani, Arie

    2008-08-15

    In this paper, we investigate the problem of estimation of a target database from summary databases derived from a base data cube. We show that such estimates can be derived by choosing a primary database which uses a proxy database to estimate the results. This technique is common in statistics, but an important issue we are addressing is the accuracy of these estimates. Specifically, given multiple primary and multiple proxy databases, that share the same summary measure, the problem is how to select the primary and proxy databases that will generate the most accurate target database estimation possible. We propose an algorithmic approach for determining the steps to select or compute the source databases from multiple summary databases, which makes use of the principles of information entropy. We show that the source databases with the largest number of cells in common provide the more accurate estimates. We prove that this is consistent with maximizing the entropy. We provide some experimental results on the accuracy of the target database estimation in order to verify our results.

  17. A Live Multimedia Stream Querying System Electrical and Computer

    E-Print Network [OSTI]

    Gupta, Amarnath

    Institute of Technology bliu@ece.gatech.edu Amarnath Gupta San Diego Supercomputer Center University

  18. Phenomenon-aware Stream Query Processing Mohamed F. Mokbel2

    E-Print Network [OSTI]

    Mokbel, Mohamed F.

    . Examples of detectable phenom- ena include pollution clouds in the air, oil spills at the ocean surface, fire alarms in a building, water floods of a river, migration of birds, and epidemic spread of diseases

  19. Model-Based Query Systems for Emergency Response 

    E-Print Network [OSTI]

    Potter, Stephen; Wickler, Gerhard

    2008-01-01

    In this paper we describe the approach adopted and experiences gained during a project to develop a general architecture that aims to harness advanced sensor, modelling and Grid technologies to assist emergency responders ...

  20. Rules and Queries with Ontologies: a Unified Logical Framework

    E-Print Network [OSTI]

    Franconi, Enrico

    languages. The focus of this paper is in the context of Semantic Web (SW), but the approach can be applied its efforts on the design of the so called Ontology Layer. Nowadays, this layer is fairly mature- mendations. One of the key features of SW ontology languages development is the atten- tion

  1. Linked Data Query Processing Tutorial at ICDE 2014

    E-Print Network [OSTI]

    Hartig, Olaf

    started to make data of public interest available as Linked Open Data, including data on CO2 emissions, the amount of Linked Open Data on the World Wide Web (WWW) has been increasing rapidly [1], [2], [3, including life sciences (e.g., DrugBank, UniProt, PubMed), geographic locations (e.g., World Factbook, Geo

  2. Declarative and Efficient Querying on Protein Secondary Structures

    E-Print Network [OSTI]

    Cafarella, Michael J.

    based on secondary structure properties. This work is a part of the Periscope project at the University. The primary structure is the linear sequence of amino acids that makes up the protein; this is the structure the linear sequence of amino acids folds into a series of three-dimensional structures. There are three basic

  3. Template:Incentive Type Page Query | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page| Open Energy Information Serbia-EnhancingEt Al., 2013) | Open EnergyDBpediaValue

  4. Oregon Certified Water Right Examiners Query Webpage | Open Energy

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QAsource History ViewMayo, Maryland:NPI VenturesNewSt.InformationImprovementsTransmission LinesInformation

  5. Multicolor Maps from Compound Queries | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX ECoop Inc Jump to: navigation,Mereg GmbHMontebalitoMt Princeton Hot

  6. Increasing ask query limit | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX E LISTStar2-0057-EA JumpDuimen RiverScoringUtilitiesRenovInceisa SA JumpSwarm

  7. T-703: Cisco Unified Communications Manager Open Query Interface Lets

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:Financing ToolInternational Affairs, Before theFebruary 1,7/109 HistoricalResources46: Debian

  8. Category:Query Results Templates | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION JEnvironmentalBowerbank,CammackFLIR Jump to: navigation,GroundNearGeothermalpower.jpgWells

  9. Querying Allocations Using cbank | Argonne Leadership Computing Facility

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservation of Fe(II) by Carbon-RichProton Delivery and RemovalQuantumdefault Sign In About |

  10. The Spatiotemporal RDF Store Strabon Kostis Kyzirakos, Manos Karpathiotakis, Konstantina Bereta, George Garbis,

    E-Print Network [OSTI]

    Koubarakis, Manolis

    of the project TELEIOS2 . Strabon is a semantic geospatial DBMS for storing and querying geospatial data in most cases performs better than any other geospatial DBMS that has been competed with. The valid timeSPARQL and extend Strabon with valid time support, in order be able to retrieve the evolution of the land cover

  11. Applications of Ontologies for Assembling Simulation Models of Industrial Systems

    E-Print Network [OSTI]

    industrial plant man- ually, which is time-consuming and error-prone. We propose to use a semi-automated models, industrial automation, SPARQL querying, design and integration 1 Introduction Modern industrialApplications of Ontologies for Assembling Simulation Models of Industrial Systems Petr Nov´ak1

  12. Join Size Estimation on Boolean Tensors of RDF Data Saskia Metzler

    E-Print Network [OSTI]

    Waldmann, Uwe

    (rdf) represents in- formation as subject­predicate­object triples. These triples are commonly approach might yield more efficient implementations of sparql query processors. Categories and Subject is the mode-1 (row) fibre, xi:k {0, 1}m is the mode- 2 (column) fibre, and xij: {0, 1}k is the mode-3 (tube

  13. Non-FMA Ontologies Is the FMA's Compatibility with

    E-Print Network [OSTI]

    Washington at Seattle, University of

    -DL Many ontologies currently implemented in DL #12;NCI Thesaurus (1) "Reference terminology and biomedical related to cancer and biomedical research #12;NCI Thesaurus (2) #12;NCI Thesaurus (3) #12;Heart (FMA) #12;Heart (NCI) #12;Heart (NCI) #12;Heart (NCI) #12;NCI Thesaurus SparQL Query #12;NCI Thesaurus Spar

  14. The authors review a log of billions of Web queries that constituted the total query traffic for a 6-month period of

    E-Print Network [OSTI]

    change over time is critical to developing effective, efficientWeb search services.TheWeb is a dynamic

  15. On the effect of INQUERY term-weighting scheme on query-sensitive similarity measures 

    E-Print Network [OSTI]

    Kini, Ananth Ullal

    2006-04-12

    have shown QSS measures to positively influence the outcome of a clustering procedure. These studies have used QSS measures in conjunction with the ltc term-weighting scheme. Several term-weighting schemes have superseded the ltc term-weighing scheme...

  16. SSB Training: SSB Basic Querying Tools Logging in to Self Service Banner (SSB)

    E-Print Network [OSTI]

    a fiscal period. Period 14 will always return the most up-to-date information for the selected fiscal year://trailhead.mines.edu 2. Enter your login information 3. Click on the Self Service Banner (SSB) icon. This will either menu you can access the Personal Information, Employee and Finance menus: 4. Click on the Finance link

  17. User-Assisted Query Translation for Interactive Cross-Language Information Retrieval

    E-Print Network [OSTI]

    Oard, Doug

    guide the user's interaction with the search system. For example, librarians learn to use facet analysis Computer Studies, University of Maryland, College Park, MD 20740 School of Information Sciences, University of Pittsburgh, 135 North Bellefield Av, Pittsburgh, PA 15260 Department of Library and Information Studies

  18. Cross-layer Routing for Peer Database Querying over Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Papapetrou, Evaggelos

    community has witnessed a significant rise of data-centric net- working applications over the last years. Furthermore, the advent of mobile devices has created an increased interest for data-centric applications. On the other hand, although significant work has been performed on data-centric applications over MANETs

  19. QL/G A Query Language for Geometric Data Edward P.F. Chan & Rupert Zhu

    E-Print Network [OSTI]

    Chan, Edward P.F.

    be expressed with the language. To facilitate the evolution of applications and to tailor to individual need A geometric database management system (DBMS) is a data base system with capabilities for the representation

  20. Computationally Feasible Query Answering over Spatio-thematic Ontologies Ozgur Lutfu Ozcep and Ralf Moller

    E-Print Network [OSTI]

    Moeller, Ralf

    classification for flooding scenarios, development of eco systems in forestry, analysis of sociological and demoscopic aspects in urban areas, or semantic web applications over GIS data [1] there is a need a large library of similar concepts and relations with mappings will emerge pretty soon. Moreover, assume

  1. Analysis of a Web User Interface for Mathematics: Experiences with Integral Queries for TILU

    E-Print Network [OSTI]

    Fateman, Richard J.

    , or deleted the de- fault entry leaving it blank. Now we simply tell the user we will integrate with respect looked at our web pages through various browsers set at various resolutions and font sizes, Moving robust against web communi- cation problems. For errors related to browser con- nections, we now record

  2. Implementing measurements and optimizing queries for the quantum hidden subgroup problem

    E-Print Network [OSTI]

    Shakeel, Asif

    2011-01-01

    arXiv:quant-ph/0411037. [11] D. Bacon, How a Clebsch-Gordanquant-ph/0501177. [21] D. Bacon, A. Childs, and V. Van Dam,Computer Science [22] D. Bacon and T. Decker, The optimal

  3. From Regular Expressions to Nested Words: Unifying Languages and Query Execution for

    E-Print Network [OSTI]

    Zaniolo, Carlo

    for such extensions has led DBMS vendors and DSMS venture companies to propose Kleene-closure extensions of SQL implementation of such constructs. These extensions, however powerful, suffer from limi- tations that severely*SQL remains extremely efficient, using our powerful optimizations for pattern search over nested words

  4. Improving Efficiency of XPath-Based XML Querying Pierre Genev`es

    E-Print Network [OSTI]

    Joseph Fourier Grenoble-I, Université

    XPath expressions look like "directory navigation paths". For example, the XPath /company/staff/employee" child elements and on to it's "employee" child elements. The result of the evaluation of the entire expression is the sequence of all the "employee" elements that can be reached in this manner, returned

  5. Towards Instance Query Answering for Concepts Relaxed by Similarity Measures Andreas Ecke

    E-Print Network [OSTI]

    Baader, Franz

    `cfAED' Partially supported by DFG in the Collaborative Research Cen- ter 912 "Highly Adaptive Energy-Efficient. A particular DL is characterized by a set of concept construc- tors, which allow to build complex concept

  6. Consistency-aware Evaluation of OLAP Queries in Replicated Data Warehouses

    E-Print Network [OSTI]

    Ordonez, Carlos

    ´ia-Garc´ia Universidad Nacional Aut´onoma de M´exico UNAM, Mexico City, CU 04510, Mexico Carlos Ordonez University updating, system failure or data corruption. Replication can be done by replacing all the dataset

  7. Spatial querying for image retrieval: a user-oriented evaluation Joemon M. Jose Jonathan Fkner

    E-Print Network [OSTI]

    Jose, Joemon M.

    The Robert Gordon University Aberdeen, AB25 lHG, Scotland Aberdeen, AB24 4FP, Scotland wuw The Robert Gordon University Aberdeen, AB25 lHG, Scotland ww.scms.rgu.ac.uk/staff/djh/ Abstract Epic

  8. Two Ellipse-based Pruning Methods for Group Nearest Neighbor Queries

    E-Print Network [OSTI]

    Huang, Zhiyong

    Sensing Applications Chinese Academy of Sciences, Beijing, China lihongga lhg@yahoo.com.cn Hua Lu School

  9. Evaluation of Anonymized ONS Queries J. G. Alfaro (joaquin.garcia-alfaro@acm.org),

    E-Print Network [OSTI]

    Garcia-Alfaro, Joaquin

    is the use of online anonymity. We present an evaluation experiment that compares the of use of Tor (The second generation Onion Router) on a global ONS/DNS setup, with respect to benefits, limitations, Onion Routing, Anonymity. 1 Introduction Electronic Product Code (EPC) is a low-cost technology, based

  10. Secure Spatial Top-k Query Processing via Untrusted Location-Based Service Providers

    E-Print Network [OSTI]

    Zhang, Rui

    , Member, IEEE, Jingchao Sun, Student Member, IEEE, Yanchao Zhang, Senior Member, IEEE, and Chi Zhang-capable and location-aware mobile devices. The system consists of a data collector, data contributors, location-based service providers (LBSPs), and system users. The data collector gathers reviews about points

  11. Democratic community-based search with XML full-text queries

    E-Print Network [OSTI]

    Curtmola, Emiran

    2009-01-01

    forms that we call the deep web. However, in practice, ait ignores entirely the deep web, which is of several orders

  12. Query-Based Sampling: Can we do Better than Random? Almer S. Tigelaar

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    a search interface. These are part of the deep web. Using conventional crawling to index the content, easily indexable, pages. The deep web consists of content that is generated dynam- ically in response of deep web pages that provide search services like this is estimated by one study to be five hundred

  13. A Query Language for Biological Networks Department for Computer Science, Humboldt-Universitt zu Berlin

    E-Print Network [OSTI]

    Freytag, Johann-Christoph

    and memory management. The code is for free available from the author. 1 Introduction Many areas of modern

  14. Semantic Similarity for Adaptive Exploitation of Inter-Query Learning Iker Gondra, and Douglas R. Heisterkamp

    E-Print Network [OSTI]

    Heisterkamp, Douglas R.

    - vant images. Distance reweighting is based on updating the weights of a weighted distance metric so that rele- vant images are closer. Some systems incorporate both approaches [6, 7]. Probabilistic feature

  15. Privacy Preserving Group Nearest Neighbour Queries in Location-based Services using

    E-Print Network [OSTI]

    Huang, Yan

    on a variety of mobile platforms like cellphones, PDA's, etc. and an increasing number of users subscribe untrusted, or the server being a communication bottleneck and a single point of failure, the power of user on a range of user hand- held devices. With the computational power of user devices increasing, users may

  16. Structured Queries for Legal Search Yangbo Zhu Le Zhao Jamie Callan Jaime Carbonell

    E-Print Network [OSTI]

    Callan, Jamie

    experiments has two compo- nents: the boolean constraint and the ranking algorithm. For each topic, we convert of wildcards. For example, "boost!" matches all words with prefix "boost". Since the O

  17. Flexible and Publicly Verifiable Aggregation Query for Outsourced Databases in Cloud

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    --For securing databases outsourced to the cloud, it is important to allow cloud users to verify and computational cost to cloud users. Our scheme is provably secure under the Static Diffie-Hellman problem, the t, outsourcing databases to cloud also raises security concerns even for non-confidential databases

  18. Multi-source Skyline Query Processing in Road Networks Ke Deng Xiaofang Zhou Heng Tao Shen

    E-Print Network [OSTI]

    Zhou, Xiaofang

    to Geographical Information Systems, to support de- cision making in the areas such as intelligent transport sys to physically move from a to b along a spatial network (e.g., roads or water systems) or on/near a terrain

  19. Customizable Point-of-Interest Queries in Road Networks Daniel Delling

    E-Print Network [OSTI]

    Makarychev, Konstantin

    Valley Mountain View, CA, USA dadellin@microsoft.com Renato F. Werneck Microsoft Research Silicon Valley Mountain View, CA, USA renatow@microsoft.com ABSTRACT We present a unified framework for exact point are not made or distributed for profit or commercial advantage and that copies bear this notice and the full

  20. In-Networks Spatial Query Estimation in Sensor Networks Silvia Nittel, Guang Jin, Yoh Shiraishi

    E-Print Network [OSTI]

    Nittel, Silvia

    University of Maine Orono, ME 04469-5711, USA nittel, jin@spatial.maine.edu Abstract Recently technology to monitor discrete and continuous phenomena in physical space. From a database perspective, a sensor network, we have developed instruments to monitor and observe the world in ways that are not obvious

  1. Automatic Hypermedia Generation for Ad-hoc Queries on Semi-structured Data

    E-Print Network [OSTI]

    Houben, Geert-Jan

    attributes or to show extra ones. The user also enters object selection criteria. We could use a language process. We address important aspects of the software that facilitates the genera- tion process. KEYWORDS for the desired information. Our target applications are collections or libraries of digital (semi

  2. Distributed Structural Relaxation of XPath Queries Georgia Koloniari and Evaggelia Pitoura

    E-Print Network [OSTI]

    Pitoura, Evaggelia

    . To reduce the cost of constructing and maintaining the clustered index, we use a compact data structure-k results, while maintaining a low construction cost for the clustered index. I. INTRODUCTION XML has clustered index aims at reducing communication and processing costs by placing similar data at the same

  3. SmartScan: Efficient Metadata Crawl for Storage Management Metadata Querying in Large File Systems

    E-Print Network [OSTI]

    Scan on production file systems show that exploiting metadata change patterns can reduce the time needed to refresh and companies of the PDL Consortium (including APC, EMC, Facebook, Google, Hewlett-Packard, Hitachi, IBM, Intel management, charge-back, and provisioning decisions. Unlike desktop search, which is designed to assist users

  4. Democratic community-based search with XML full-text queries

    E-Print Network [OSTI]

    Curtmola, Emiran

    2009-01-01

    Keyword Search for Smallest LCAs in XML Databases. In ACMby computing the least common ancestor (LCA): if !empty(result) lca=LCA($pos1,, $posN) if ! empty(lca)

  5. Event-Oriented Data Models and Temporal Queries in Transaction-Time Databases

    E-Print Network [OSTI]

    Zaniolo, Carlo

    on SQL-compliant DBMS. More recently however, there has been significant interest and progress on event standards, a first interesting development is that several DBMS vendors are proposing new specs in the past (as opposed to the human recreated history of a valid-time database). Furthermore, for web doc

  6. Multi-query optimization for sketch-based estimation$ Alin Dobra a,, Minos Garofalakis b

    E-Print Network [OSTI]

    Garofalakis, Minos

    n f o Article history: Received 3 July 2007 Received in revised form 15 May 2008 Accepted 20 June rights reserved. 1. Introduction Traditional Database Management Systems (DBMS) software is built accumulated and archived in the DBMS of a (perhaps, off-site) data warehouse, often making access

  7. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)

    2011-02-01

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  8. Using Bitmap Index for Joint Queries on Structured and Text Data

    E-Print Network [OSTI]

    Stockinger, Kurt

    2009-01-01

    FastBit system provides the full SQL functionality, theoverhead of supporting SQL is not the main reason for theFastBit system has full SQL support and is much closer to

  9. MULTITEMPORAL GEOSPATIAL QUERY GROUPING USING CORRELATION Giorgos Mountrakis Peggy Agouris Anthony Stefanidis

    E-Print Network [OSTI]

    Mountrakis, Giorgos

    common metadata parameters (e.g. location, scale, resolution, time, sensor). The result and earth-based sensors have resulted in the availability of substantial volumes of spatiotemporal datasets indexed according to their metadata information. For example, an image may be indexed according to its

  10. RealTime SpatioTemporal Query Processing in Mobile AdHoc Sensor Networks

    E-Print Network [OSTI]

    that has multiple sensors (e.g., mo­ tion sensors, acoustic sensors, infrared light emitting diodes,

  11. Real-Time Spatio-Temporal Query Processing in Mobile Ad-Hoc Sensor Networks

    E-Print Network [OSTI]

    that has multiple sensors (e.g., mo- tion sensors, acoustic sensors, infrared light emitting diodes, and pa

  12. Integrated storage and querying of spatially varying data quality information in a relational spatial database

    E-Print Network [OSTI]

    Duckham, Matt

    spatial database M.G.S.M Zaffar Sadiq and Matt Duckham Department of Geomatics, University of Melbourne Variation in Quality Keywords Spatial data quality; spatial database; relational database management system for storing and retrieving spatially varying data quality information in a relational spatial database. Rather

  13. SDMOQL: An OQL-based Data Mining Query Language for Map Interpretation Tasks

    E-Print Network [OSTI]

    Malerba, Donato

    Information System. INGENS (Inductive Geographic Information System) is a prototype GIS which integrates data data mining tasks in INGENS: inducing classification rules and discovering association rules. Only in topographic map interpretation tasks. A prototype of GIS has been built around this application. INGENS

  14. Building Simulated Queries for Known-Item Topics: An Analysis using Six European Languages

    E-Print Network [OSTI]

    Azzopardi, L.

    Azzopardi,L. de Rijke,M. Balog,K. To appear in the Proceedings of the 30th Annual ACM Conference on Research and Development in Information Retrieval (SIGIR 2007)

  15. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris; Tang, Diane L; Hanrahan, Patrick

    2014-04-29

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  16. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)

    2012-03-20

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  17. Web-based Selection of Optimal Translations of Short Queries Paolo Rosso and Davide Buscaldi

    E-Print Network [OSTI]

    Rosso, Paolo

    : Traducci´on Autom´atica, B´usqueda de Respuestas Multiling¨ue, Miner´ia de Datos en la Web Abstract

  18. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets

    E-Print Network [OSTI]

    of Western Ontario eschost@uwo.ca July, 2013 hal-00849057,version1-30Jul2013 #12;Abstract A roadmap for computing roadmaps, given by Basu, Pollack and Roy, was sd+1 DO(n2) where the input is given more freedom for the design of algorithms computing roadmaps and led to a first probabilistic roadmap

  19. Querying Temporal Databases via OWL 2 QL Szymon Klarman and Thomas Meyer

    E-Print Network [OSTI]

    Meyer, Tommie

    Intelligence Research, CSIR Meraka and University of KwaZulu-Natal, South Africa {sklarman architecture and differing in the flavour and depth of temporal reasoning they support, aim at addressing

  20. A Semi-Automatic Object Extraction Tool for Querying in Multimedia Databases

    E-Print Network [OSTI]

    Ulusoy, Özgür

    , the object extraction methods can be grouped into three categories: Fully Automatic Extraction Methods: In these methods, the extraction process for image and/or video data is performed automatically. Since the whole extraction. This method processes only images and video frames having a separable background 1]. Jain

  1. Data Mining Query Languages Jean-Francois Boulicaut1 and Cyrille Masson1

    E-Print Network [OSTI]

    Boulicaut, Jean-François

    . In practice, knowl- edge elicitation is based on some extracted and materialized (collections of) patterns are exceptions to frequent and valid association rules or the selection of misclassified examples with a decision and Knowledge Discovery Handbook, 2nd ed., DOI 10.1007/978-0-387-09823-4_33, © Springer Science+Business Media

  2. EECS 498 -002: Database Design and Query (2 cr.) Instructor: K. LeFevre

    E-Print Network [OSTI]

    Cafarella, Michael J.

    .) Instructor(s): R. Nadakuditi Prerequisite(s): Basic probability theory and linear algebra Course details(s): Basic knowledge in optics Course details: http://www.eecs and (EECS 280 or 282) or Grad. Standing Course details: See Instructor [NOTE: -002 & -003 meet with EECS 484

  3. A Low-Cost Global Network for Data Collection and Query Audrey Colbrant

    E-Print Network [OSTI]

    Joseph Fourier Grenoble-I, Université

    -level uninterrupted power supply (UPS) [7]. A cheaper and simpler way to go if we want the server to be safe of power ISSUES A central server in a developing country is subject to dis- rupting operations due to power interruptions. Depending on the frequency and duration of power outages, quite high in Dharamsala for example

  4. Pathfinder: A Relational Query Optimizer Explores XQuery Terrain Torsten Grust Jan Rittinger Jens Teubner

    E-Print Network [OSTI]

    Teubner, Jens

    -Lifting: Turning XQuery into Relational Plans SERIALIZE FRAG_UNION ¶ (iter:outer, pos:pos1, item) EMPTY_FRAG FRAGs ROW# (pos1:pos>/outer) ELEM (iter, item:pos, item>) FRAG_UNION ELEM_TAG FRAG_UNION FRAGs @ (item), val: item ¶ (iter, pos:pos1, item) FRAGs TEXT (res:) ATTR (res:) |X

  5. Our reference: POWER 13642 P-authorquery-v8 AUTHOR QUERY FORM

    E-Print Network [OSTI]

    Peng, Huei

    s t r a c t In a proton exchange membrane fuel cell (PEMFC), flow field design is an important factor before they are machined. © 2010 Published by Elsevier B.V. 1. Introduction21 The performance of a PEMFC water.30 A PEMFC stack consists of multiple cells connected by bipolar31 plates. They account

  6. Probabilistic Resource Route Queries with Reappearance Gregor Joss, Klaus Arthur Schmid, Matthias Schubert

    E-Print Network [OSTI]

    Kriegel, Hans-Peter

    , Germany {josse,schmid,schubert}@dbs.ifi.lmu.de ABSTRACT In many routing applications, it is unclear With increasing gas prices, escalating greenhouse gas emissions and heavy traffic congestion in metropolitan areas vacant spots upon arrival. Another example are drivers of electric cars looking for public charging sta

  7. Data Parallel Bin-Based Indexing for Answering Queries on Multi-Core Architectures

    E-Print Network [OSTI]

    Gosink, Luke

    2009-01-01

    DP-BIS) ?rst bins the base data, and then partitions andlocations in the OrBiC Base Data, and Row-ID tables for thesolely on a column’s base data; this smaller data footprint

  8. Assembling regions for efficacious aggregate query processing in wireless sensor networks

    E-Print Network [OSTI]

    Fertis, Apostolos

    2005-01-01

    The field of sensor networks is rapidly developing enabling us to deploy them to an unpredictable environment and draw diverse and interesting information from it. Their capabilities are improving. They can sense complicated ...

  9. A SERVICE FRAMEWORK FOR LEARNING, QUERYING, AND MONITORING MULTIVARIATE TIME SERIES

    E-Print Network [OSTI]

    Lin, Jessica

    Drive MSN 4A5, Fairfax, Virginia 22030- 4422, United States cngan@gmu.edu, brodsky@gmu.edu, jessica monitor daily stock prices, weekly interest rates, and monthly price indices to analyze different states death rates in a population region. To support such decision-marking and determination over multivariate

  10. An Event-Based Service Framework for Learning, Querying, and Monitoring Multivariate Time Series

    E-Print Network [OSTI]

    Lin, Jessica

    University, 4400 University Drive MSN 4A5, Fairfax, Virginia 22030-4422, United States {cngan, brodsky rates, and monthly price indices to analyze different states of stock markets. In medical studies pressure and pulse anomalies on electrocardiogram, as well as low birth but high death rates in a #12

  11. Time to Leave the Trees: From Syntactic to Conceptual Querying of XML ?

    E-Print Network [OSTI]

    Ludäscher, Bertram

    Altintas Amarnath Gupta San Diego Supercomputer Center University of California, San Diego fludaesch

  12. Declarative Specification of Gene Regulatory Networks and Query Evaluation in PathSys

    E-Print Network [OSTI]

    Gupta, Amarnath

    Abstract) Amarnath Gupta Yang Yang Aditya Bagchi Animesh Ray University of California Indian Statistical

  13. A Market Mechanism for Participatory Global Query: A First Step of Enterprise Resources Self-Allocation

    E-Print Network [OSTI]

    Hsu, Cheng

    in works for computing and manufacturing [Clearwater 1996]. A common theme in these results is to turn exchange. This paradigm works when all participating databases belong to a single authority (such-scale enterprise information exchange, a market mechanism has the potential to promote proactive participation

  14. The Role of Documents vs. Queries in Extracting Class Attributes from Text

    E-Print Network [OSTI]

    Cortes, Corinna

    of medium text text Purpose convey info. request info. Available context surrounding text self-contained Average quality high (varies) low Grammatical style natural language keyword-based Average length 12 to 25 [4], they have yet to capitalize on an alternative resource of textual information (i.e., search

  15. A Demonstration of Shahed: A MapReduce-based System for Querying and Visualizing Satellite Data

    E-Print Network [OSTI]

    Minnesota, University of

    for scientists and re- searchers and is very useful for studying climate, desertification, and land use change of desertification, and climate infor- matics. Data is collected at different temporal resolutions (e.g., daily

  16. SHAHED: A MapReduce-based System for Querying and Visualizing

    E-Print Network [OSTI]

    Minnesota, University of

    applications including climate change, desertification, and land use change. The benefit of this data comes by meteorologists and other scientists in several important applications, including detection of desertification [4

  17. Our reference: RENE 4564 P-authorquery-v9 AUTHOR QUERY FORM

    E-Print Network [OSTI]

    Keywords: Wind potential Wind energy Climate changes Wind scenarios a b s t r a c t Brazil's wind energy Elsevier Ltd. All rights reserved. 1. Introduction Brazil's wind energy production has escalated up from 22 approved as a result of the rst wind-only bidding round for energy supply in Brazil of December 2009

  18. An Expert System for Automatic Query Reformulation Susan Gauch* and John B. Smith+

    E-Print Network [OSTI]

    Kansas, University of

    , and their search performance using an online thesaurus. The following conclusions were reached: 1) The expert with the user searching alone or with the thesaurus. 2) The expert system produced marginally significant

  19. Characterizing Web Search Queries that Match Very Few or No Results

    E-Print Network [OSTI]

    Ulusoy, Özgür

    Research Center Hannover, Germany altingovde@l3s.de Roi Blanco Yahoo! Research Barcelona, Spain roi University Ankara, Turkey rozcan@cs.bilkent.edu.tr Erdem Sarigil Bilkent University Ankara, Turkey esarigil@cs.bilkent.edu.tr Özgür Ulusoy Bilkent University Ankara, Turkey oulusoy@cs.bilkent.edu.tr ABSTRACT Despite the continuous

  20. Inquiry and Introspection for Non-Deterministic Queries in Mobile Networks

    E-Print Network [OSTI]

    Payton, Jamie

    , Christine Julien1 , Jamie Payton2 , and Gruia-Catalin Roman3 1 Department of Electrical and Computer and Engineering Washington University in Saint Louis roman@wustl.edu Abstract. This paper focuses to question the soundness of the decision process. Am I asking the right question? Am I looking in the right

  1. Materialized Views in Probabilistic Databases For Information Exchange and Query Optimization

    E-Print Network [OSTI]

    Thrun, Sebastian

    probabilistic data contain correlations between tuples, and the current approach is to capture these correla (BID) table. Not all views can be rep- resented as BID tables and so we propose a novel partial processing on probabilistic data, we can ignore the lineage and use materialized views to more efficiently

  2. V-204: A specially crafted query can cause BIND to terminate abnormally |

    Broader source: Energy.gov (indexed) [DOE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyThe U.S.Lacledeutilities. The Economics ofConductMultipleAccountPotentiallyDepartment

  3. U-038: BIND 9 Resolver crashes after logging an error in query.c |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankADVANCEDInstallers/ContractorsPhotovoltaicsStateof Energy TwoEvent at the Pu2: AppleGainDepartment of

  4. Policy driven development : SOA evolvability through late binding

    E-Print Network [OSTI]

    Demchak, Barry

    2013-01-01

    System SoS System of Systems SQL Structured Query Languagetechnique. Structured Query Language (SQL) StructuredQuery Language (SQL) is a declarative language suited to the

  5. A social marketing approach to implementing evidence-based practice in VHA QUERI: the TIDES depression collaborative care model

    E-Print Network [OSTI]

    Luck, Jeff; Hagigi, Fred; Parker, Louise E; Yano, Elizabeth M; Rubenstein, Lisa V; Kirchner, JoAnn E

    2009-01-01

    vafacts.asp] Kotler P: Marketing management 11th edition.2003. Andreasen A: Marketing Social Change San Francisco:Roberto N, Lee N: Social marketing: Improving the quality of

  6. Metabolomic database annotations via query of elemental compositions: Mass accuracy is insufficient even at less than 1 ppm

    E-Print Network [OSTI]

    Kind, T; Fiehn, O

    2006-01-01

    literature: the Chemical Abstracts Service (CAS) database. ADatabase name Chemical Abstracts (CAS) Beilstein Database (

  7. Unified Data Access/query over Integrated Data-views for Decision Making in Geographic Information Systems

    E-Print Network [OSTI]

    disaster planning, crisis management and early-warning systems. Decision making in Geographic Information in Astronomy and Geographic Information Systems, respectively. We are now at the point that we can put management and early-warning systems. Decision making in Geographic Information Systems (GIS) increasingly

  8. Extensible Query Processing in Starburst Laura M. Haas, J.C. Freytag 1, G.M. Lohman, and H. Pirahesh

    E-Print Network [OSTI]

    Mannheim, Universität

    the increasing de- mands of the various applications that would like to use a DBMS. Each kind of application poses new requirements for the DBMS. The Starburst project at IBM's Almaden Research Center aims to extend relational DBMS technology to bridge this gap between applications and the DBMS. While providing

  9. The ALqua Approximate Query Answering System Swar,up Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy*

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    applications. It has been designed to run on top of any commercial relational DBMS. Aqua precom:putes synopses (special statistical summaries) of the original data and stores them in the DBMS. It provides approximate-compliant DBMS managing a data ware- house. Aqua precomputes statistical summaries, called synopses

  10. The Image Stack Stream Model, Querying, and Architecture Alfonso F. Crdenas Raymond K. Pon Bassam S. Islam

    E-Print Network [OSTI]

    Cárdenas, Alfonso F.

    of a DBMS, since more sensors will capture data on a real-time basis. We outline requirements for modeling of a DBMS as permanent storage. 1. Introduction Growing types and volumes of multimedia data (alphanumeric changing through time. Current DBMS's (relational or object DBMS's) deal well with alphanumeric record type

  11. A Query Calculus for Spatio-Temporal Object Databases Tony Griffiths, Alvaro A. A. Fernandes, Nassima Djafri, Norman W. Paton

    E-Print Network [OSTI]

    Paton, Norman

    the development of a com- plete spatio-temporal DBMS. This has given rise to a sub- stantial collection of results and aspatial data. ODMG Model Temporal Types Spatial Types Histories Spatio-Temporal Algebra Spatio using histories. A history is a set of timestamp-value pairs, where the timestamp is of a temporal type

  12. A Query Calculus for SpatioTemporal Object Databases Tony Griffiths, Alvaro A. A. Fernandes, Nassima Djafri, Norman W. Paton

    E-Print Network [OSTI]

    Fernandes, Alvaro A. A.

    the development of a com­ plete spatio­temporal DBMS. This has given rise to a sub­ stantial collection of results and aspatial data. ODMG Model Temporal Types Spatial Types Histories Spatio-Temporal Algebra Spatio using histories. A history is a set of timestamp­value pairs, where the timestamp is of a temporal type

  13. Enabling Real-Time Querying of Live and Historical Stream Data Frederick Reiss1,2,3

    E-Print Network [OSTI]

    Hellerstein, Joseph M.

    data only. While tra- ditional Database Management Systems (DBMS) can easily handle archived stream both real-time information about the stream and stored in- formation about the past history

  14. Evaluation Results for a Query-Based Diagnostics Application John Mark Agosta, john.m.agosta@intel.com

    E-Print Network [OSTI]

    Poupart, Pascal

    to the Lean Manufacturing philosophy of the rm, speci- cally by standardizing problem-solving for di- agnosis and inference phases. In this paper we describe a successful eld trial of such a system in manufacturing successfully elded and evaluated by Intel Manufacturing to validate its use in practice. We will refer

  15. Querying quantitative logic models (Q2LM) to study intracellular signaling networks and cell-cytokine interactions

    E-Print Network [OSTI]

    Morris, Melody K.

    Mathematical models have substantially improved our ability to predict the response of a complex biological system to perturbation, but their use is typically limited by difficulties in specifying model topology and parameter ...

  16. A Declarative Language for Querying and Restructuring the Web \\Lambda Laks V.S. Lakshmanan Fereidoon Sadri Iyer N. Subramanian

    E-Print Network [OSTI]

    Sadri, Fereidoon "Fred"

    . In this paper, we develop a simple logic called WebLog that is capable of retrieving information from HTML of applications involving real­life information in the Web. Keywords: World Wide Web, Structured documents, HTML such a need. Most information in the Web is present in the form of Hypertext Markup Language (HTML) documents

  17. How can I query data on OpenEI and generate a map? | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIXsource History View NewGuam: Energyarea,Magazine Jump to:IICommunity How can I

  18. Heliophysics Observatory

    E-Print Network [OSTI]

    Aulanier, Guillaume

    ........................................................................................................9 4.2 SQL query.................................................................................................................................14 SQL basics

  19. Beyond Information Retrieval--Medical Question Answering Minsuk Lee1

    E-Print Network [OSTI]

    Yu, Hong

    of information in response to a specific user query. For example, querying PubMed about the drug celecoxib

  20. A SessionBased Search Engine Smitha Sriram, Xuehua Shen, Chengxiang Zhai

    E-Print Network [OSTI]

    Zhai, ChengXiang

    including expansion of the current query with user query history and clickthrough data (title and summary models General Terms Algorithms Keywords Query history, query expansion, context 1. INTRODUCTION In web Session Engine Manager Text DB DBMS Internet Query Clickthrough Data Web Browser Search Result CGI Query

  1. U.S. VERSUS EUROPEAN WEB SEARCHING TRENDS Amanda Spink

    E-Print Network [OSTI]

    Jansen, James

    and structure, (2) mean query and session durations, (3) search terms per query, and (4) terms in queries, and seconds, Query: user terms as entered. We analyzed user: Sessions - entire query sequence by a user; Queries - one or more entered terms; Terms - any string of characters bounded by white space. Table 1

  2. Toward a Data Scalable Solution for Facilitating Discovery of Science Resources

    SciTech Connect (OSTI)

    Weaver, Jesse R.; Castellana, Vito G.; Morari, Alessandro; Tumeo, Antonino; Purohit, Sumit; Chappell, Alan R.; Haglin, David J.; Villa, Oreste; Choudhury, Sutanay; Schuchardt, Karen L.; Feo, John T.

    2014-12-31

    Science is increasingly motivated by the need to process larger quantities of data. It is facing severe challenges in data collection, management, and processing, so much so that the computational demands of “data scaling” are competing with, and in many fields surpassing, the traditional objective of decreasing processing time. Example domains with large datasets include astronomy, biology, genomics, climate/weather, and material sciences. This paper presents a real-world use case in which we wish to answer queries pro- vided by domain scientists in order to facilitate discovery of relevant science resources. The problem is that the metadata for these science resources is very large and is growing quickly, rapidly increasing the need for a data scaling solution. We propose a system – SGEM – designed for answering graph-based queries over large datasets on cluster architectures, and we re- port performance results for queries on the current RDESC dataset of nearly 1.4 billion triples, and on the well-known BSBM SPARQL query benchmark.

  3. OCONUS and OVERSEAS Per Diem Rates: Query Results http://www.defensetravel.dod.mil/pdcgi/pd-rates/opdrates.cgi[1/23/2014 10:31:28 AM

    E-Print Network [OSTI]

    Hardy, Christopher R.

    /01/2012 LUALUALEI NAVAL MAGAZINE 01/01- 12/31 177 91 52 23 291 07/01/2013 MOLOKAI 01/01- 12/31 131 58 35 14 203 07

  4. Queries for ecol-89-04-15 1. ED: Petchey is spelled Petchy in Lit Cit. Please reconcile. AP/ccb

    E-Print Network [OSTI]

    Sekercioglu, Cagan Hakki

    species. Based on a global data base, bird assemblages in tropical agroforest ecosystems were comprised habitats. This is important for data-based management of tropical human-dominated landscapes sustaining, California, USA 3 Center for Tropical Research, University of California Los Angeles, Los Angeles, California

  5. Cite this paper as follows: Lisa (Ling) Liu, Bertrand Meyer and Bernd Schoeller, Using contracts and boolean queries to improve the

    E-Print Network [OSTI]

    Meyer, Bertrand

    likely to uncover bugs. The key issue is to define criteria for selecting such interesting states to actual production software, in particular the EiffelBase library of fundamental data structures of automatic test generation Lisa (Ling) Liu Bertrand Meyer Bernd Schoeller Chair of Software Engineering, ETH

  6. Web Search Queries as a Corpus Tutorial at the 49th Annual Meeting of the Association for Computational Linguistics (ACL 2011)

    E-Print Network [OSTI]

    to facts capturing quantifiable properties of a class or an instance ­ actors --> awards, birth date, anosmia, myxedema,... potassium, magnesium, gold, sulfur, palladium, argon, carbon, borium, ruthenium,... potassium, magnesium, gold, sulfur, palladium, argon, carbon, borium, ruthenium, zinc, lead,... fish, turkey

  7. Home Page| Database Search| Online Tools| MetaData Query| Standard Criterion| Data Center| About BMICC| Login| | --> English News --> Biology News

    E-Print Network [OSTI]

    Sóbester, András

    pipelines, and methane naturally leaking from the seabed, could in future be detected using changes into the atmosphere of gases from the seabed. This applies both to gas extracted by the petrochemical industries and to the methane which is naturally released from the seabed." Natural leaks of methane gas can be damaging

  8. Effective Exploration of Web and Social Network Data

    E-Print Network [OSTI]

    Cheng, Shiwen

    2015-01-01

    2 Estimate Query Timeliness for Web Search Queries 2.1construction on the social web. In ESWC, pages 375–389,Varying approaches to topical web query classification. In

  9. Energy Information, Data, and other Resources | OpenEI

    Open Energy Info (EERE)

    provides inline queries in the form of an Ask query, which can also be modified into a web service (see OpenEI REST services documentation). Ask queries can be executed here and...

  10. Federated Web-accessible Clinical Data Management within an Extensible NeuroImaging Database

    E-Print Network [OSTI]

    2010-01-01

    both static and dynamic SQL backed), and action buttons. Toto the corresponding SQL query (ies) by query builderAST nodes and build a complex SQL query corresponding to the

  11. Predicting and Optimizing System Utilization and Performance via Statistical Machine Learning

    E-Print Network [OSTI]

    Ganapathi, Archana

    2009-01-01

    61 test set queries, using SQL text statistics to constructProgress Of Execution For SQL Queries. In SIGMOD ’04: Pro-We Trust Progress Estimators For SQL Queries? In SIGMOD ’05:

  12. Identifying Sets of Related Words from the World Wide Web SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL

    E-Print Network [OSTI]

    Pedersen, Ted

    " . . . . . . . . . . . . . . . . . . . . . . . . . 14 2 Resulting Top 10 Web Pages for query "pistol" . . . . . . . . . . . . . . . . . . . . . . . . 14 3 Resulting Top 10 Web Pages for query "pistol AND gun" . . . . . . . . . . . . . . . . . . . 15 4 Resulting Top 10 Web Pages doe query "gun AND pistol" . . . . . . . . . . . . . . . . .

  13. Explicit Extraction of Topical Context Rianne Kaptein

    E-Print Network [OSTI]

    Kamps, Jaap

    effective information access: the poverty on the query end. We explore whether users can classify key- word effective information access: the poverty on the query end. With an average query length of about two terms

  14. Performances of Multi-Level and Multi-Component Compressed Bitmap Indices

    E-Print Network [OSTI]

    Wu, Kesheng; Stockinger, Kurt; Shoshani, Arie

    2007-01-01

    Query processing cost Given above index sizes, we can nowfor the index sizes and query processing costs. LBNL-60891processing cost using a projection index, which is exactly

  15. Context-sensitive ranking

    E-Print Network [OSTI]

    Chen, Liang

    2012-01-01

    Urata. Answering complex sql queries using automatic summarythe SELECT clause contains SQL aggregate functions, e.g. ,aggregation view is defined by a SQL query with aggregation

  16. Scientific Data Services -- A High-Performance I/O System with Array Semantics

    E-Print Network [OSTI]

    Wu, Kesheng

    2013-01-01

    Structured Query Language (SQL) for users to access the datareason for this choice is that SQL was not expressive enoughdevelopers are expanding SQL to support queries on arrays.

  17. Help:External SPARQL integration | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX E LISTStar2-0057-EA JumpDuimen River PowerHeckert BXT SolarHelioNova S L

  18. User:Woodjr/Sandbox/Sparql | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION JEnvironmental Jump to:EA EISTJThin FilmUnited States:User page

  19. tree : A New Class Hierarchy Access Method for ObjectOriented Databases

    E-Print Network [OSTI]

    Ooi, Beng Chin

    Ø­tree : A New Class Hierarchy Access Method for Object­Oriented Databases Abstract The semantic­oriented queries. In particular, the class hierar­ chy concept has an impact on the class scope of queries: an object­oriented query on a class C can be interpreted as to retrieve all objects that satisfy the query

  20. CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2007; 00:19 Prepared using cpeauth.cls [Version: 2002/09/19 v2.02

    E-Print Network [OSTI]

    Plale, Beth

    ] project to collect and query over provenance generated from meso-scale weather forecasting workflows

  1. LCA-based Selection for XML Document Collections Georgia Koloniari

    E-Print Network [OSTI]

    Pitoura, Evaggelia

    LCA-based Selection for XML Document Collections Georgia Koloniari Department of Computer Science in the collection to the query. We consider keyword queries and support Lowest Common Ancestor (LCA) semantics of the LCA of those nodes in the XML docu- ment that contain the query keywords. To avoid evaluating queries

  2. CIS 452--Spring 2015 Texas A&M University Central Texas

    E-Print Network [OSTI]

    Diestel, Geoff

    and description: This course is a study of Structured Query Language (SQL), including relational database schema in SQL, formulating SQL queries and sub queries of varying complexity, embedding SQL statements in a "host" language, defining and querying data views in SQL, and other related topics. Course Objective

  3. CIS 452-115 Summer 2013 Texas A&M University Central Texas

    E-Print Network [OSTI]

    Diestel, Geoff

    Overview and description: This course is a study of Structured Query Language (SQL), including relational database schema in SQL, formulating SQL queries and sub queries of varying complexity, embedding SQL statements in a "host" language, defining and querying data views in SQL, and other related topics

  4. Library Account After logging into your Library Account from the library's homepage or signing into your account from Library

    E-Print Network [OSTI]

    Chrispell, John

    or signing into your account from Library Search, you can save search queries, save citations to your e-shelf, and organize your citations into folders. Saving Search Queries Conduct a search and then scroll down to the bottom of the REFINE MY RESULTS menu and click Save query. In the new window, name your query. If you

  5. 86 CommuniCAtions of the ACm | oCtobER 2009 | vol. 52 | No. 10 rELATIONAL SySTEMS HAVE made it pos-

    E-Print Network [OSTI]

    Waldmann, Uwe

    a low-cost execution plan among all plans that are equivalent to the given query expression (consider in supporting complex decision-support queries would not have been a reality without innovation in query in- fluence the cost of executing the query. Examples of such statistical properties are total number

  6. Smithsonian/NASA ADS Physics/Geophysics Abstract Service Find Similar Abstracts (with default settings below)

    E-Print Network [OSTI]

    Mojahedi, Mohammad

    Smithsonian/NASA ADS Physics/Geophysics Abstract Service · Find Similar Abstracts (with default | Query Form | Preferences | HELP | FAQ Physics/Geophysics arXiv e-prints Send Query Reset #12;

  7. 2PC-UTRB, 89 ACID properties, 10

    E-Print Network [OSTI]

    McBrien, Peter

    DML, 9 document type definition, 114 double index, 75 drill down, 22 DTD, 114 Durability, 10 edge step, 93 intermediate query language, 24 internal level, 8 #12;INDEX 147 intra-query parallelism, 64

  8. Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the ACL, pages 305312, Sydney, July 2006. c 2006 Association for Computational Linguistics

    E-Print Network [OSTI]

    for which multiple rele- vant documents are known for a query, we formu- late our model in terms r, where rdq = 1 if an only if document d is rele- vant to query q. In multidocument summarization

  9. Data-Parallel Computing Meets STRIPS Erez Karpas and Tomer Sagi and Carmel Domshlak and Avigdor Gal and Avi Mendelson

    E-Print Network [OSTI]

    Williams, Brian C.

    processing, the user of a database management system (DBMS) specifies her data processing goal as a declarative query, and the DBMS au- tomatically generates a query plan, i.e., a data processing program

  10. Methodology Comparisons in Progressive Transfer of Vector-Based Geographic Data

    E-Print Network [OSTI]

    Mirzabeigi, Ali

    2011-01-01

    Peter Van Oosterom [25] Microsoft SQL Server 2008 R2 Product21  Listing 3: SQL query to retrieve all the edges of SanI. ------------- 36  Listing 4: SQL query to retrieve all

  11. ITS Identity, Security & Desktop Services System Access Request Date 10-14-2013 Page 1

    E-Print Network [OSTI]

    Su, Xiao

    Reports and Processes Query--Run Public Queries Training Required CFS Data Warehouse (FIN008) Time Approver CFS ProCard/GoCard Recon (FIN903) CFS Receipts & Inspections (FIN902) CMS Security Team Use Only

  12. R. Meo et al. (Eds.): Database Support for Data Mining Applications, LNAI 2682, pp. 95116, 2004. Springer-Verlag Berlin Heidelberg 2004

    E-Print Network [OSTI]

    Ceci, Michelangelo

    from a Geographic Information System (GIS). INGENS (INductive GEographic iNformation System Mining Object Query Language), a spatial data mining query language used in INGENS, whose design is based

  13. Efficient Private Information Retrieval Using Secure Xiangyao Yu, Christopher W. Fletcher

    E-Print Network [OSTI]

    is not trusted and would leak the query when executed on conventional secure processors. Stream-Ascend is based. In a map database, frequent queries to a partic- ular geographical region may indicate the drilling

  14. Geothermal National Environmental Policy Act Database on Publicly...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    i i QUERY BY ACTIVITY FOR MORE INFORMATION EXAMPLE NEPA DOCUMENT COLLECTION QUERY BY GEOTHERMAL AREA NREL is a national laboratory of the U. S. Department of Energy, Office of...

  15. 612 | VOL.8 NO.8 | AUGUST 2011 | nature methods correspondence

    E-Print Network [OSTI]

    Cai, Long

    Chemicals Container sizeContainer type Container locationPreparation Container a b Enter search term: ExactFreezer. After entering a query at the reagent search page, reagents matching the query are displayed with links

  16. Tracing Lineage in Multi-version Scientific Databases Mingwu Zhang Daisuke Kihara and Sunil Prabhakar

    E-Print Network [OSTI]

    Kihara, Daisuke

    . We establish the validity of the approach in enabling rele- vant queries and study the space and time

  17. Development, implementation, and a cognitive evaluation of a definitional question answering system for physicians

    E-Print Network [OSTI]

    Yu, Hong

    , the number of retrieved documents is large. For example, querying PubMed about the drug celecoxib results

  18. Intent-Aware Search Result Diversification Rodrygo L. T. Santos

    E-Print Network [OSTI]

    Jose, Joemon M.

    queries (e.g., `zeppelin') have multiple interpretations (e.g., `airship', `band'). On the other hand

  19. Shape Matching Michael Kazhdan

    E-Print Network [OSTI]

    Kazhdan, Michael

    · Minimum SSD Descriptor #12;Goal Given a database of 3D models, and given a query shape, find the database it is to M3 #12;Database Retrieval · Compute the distance from the query to each database model 3D Query Database Models Q M1 M2 Mn D(Q,Mi) #12;Database Retrieval · Sort the database models by proximity 3D Query

  20. G. Vossen, D.D.E. Long, and J.X. Yu (Eds.): WISE 2009, LNCS 5802, pp. 307320, 2009. Springer-Verlag Berlin Heidelberg 2009

    E-Print Network [OSTI]

    Liu, Chengfei

    . The query asks for the diseases that are associated with cough and cause of fatigue. We add the superscript