text:
XML documents. It is a powerful language that incorporates both strutural and datatype modeling features. There are many benefits to storing XML Schema compliant data in a database system, including better queryability, optimied updates and stronger validation. However, the fidelity of the XML document cannot be sacrificed. Thus, the fundamental problem facing database implementers is: how can XML Schemes be mapped to relational (and object-relational) database without losing schema semantics or data-fidelity? In this paper, we present the Oracle XML DB solution for a flexible mapping of XML Schemas to object-relational database. It preserves document fidelity, including ordering, namespaces, comments, processing instructions etc., and handles all the XML Schema semantics including cyclic definitions, dervations (extension and restriction), and wildcards. We also discuss various query and update optimiations that involve rewriting XPath operations to directly operate on the underlying relational data.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1009–1018},
numpages = {10},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315539,
author = {Hage, C. and Jensen, C. S. and Pedersen, T. B. and Speicys, L. and Timko, I.},
title = {Integrated Data Management for Mobile Services in the Real World},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Market research companies predict a huge market for services to be delivered to mobile users. Services include route guidance, point-of-interest search, metering services such as road pricing and parking payment, traffic monitoring, etc. We believe that no single such service will be the killer service, but that suites of integrated services are called for. Such integrated services reuse integrated content obtained from multiple content providers.This paper describes concepts and techniques underlying the data management system deployed by a Danish mobile content integrator. While georeferencing of content is important, it is even more important to relate content to the transportation infrastructure. The data management system thus relies on several sophisticated, integrated representations of the infrastructure, each of which supports its own kind of use. The paper covers data modeling, querying, and update, as well as the applications using the system.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1019–1030},
numpages = {12},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315540,
author = {Cabrera, L. F.},
title = {Web Services (Industrial Session)},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Web services have become a mainstream developmemt in the industry. Their emergence is based on the mechanisms that made Web Browsing popular: the existence of a pervasive networking infrastructure, the widely deployed availability of communication protocols such as IP, TCP, UDP and HTTP, the standardization of XML documents and their display by browsers, and the emergence of higher level transports such as SOAP. In additiom standard services such as UDDI and description languages such as WSDL established a base on which services could be specified, described, and published. Thus, the begning of the inter Web Service communication was founded.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1031–1032},
numpages = {2},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315541,
author = {Leymann, Frank},
title = {Grid and Applications (Industrial Session)},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1033},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315542,
author = {Sch\"{o}ning, Harald},
title = {Commercial Use of Database Technology},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {This session provides insight into two different European products for the E-commerce/database market. First, Martin Meijsen, Software AG, gives an overview on Tamino, Software AG's XML DBMS while the second presentation by Eva K\"{u}hn of TECCO AG, Austria discusses technical details of products that provides "zero-delay access to data warehouses",},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1034},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315543,
author = {K\"{u}hn, Eva},
title = {The Zero-Delay Data Warehouse: Mobilizing Heterogeneous Database},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {"Now is the time... for the real-time enterprise": In spite of this assertion from Gartner Group the heterogeneity of today's IT environments and the increasing demands from mobile users are major obstacles for the creation of this vision. Yet its technical foundation is available: software architectures based on innovative middleware components that offer a level of abstraction superior to conventional middleware solutions, including distributed transactions and the seamless integration of mobile devices using open standards, crossing the borders between heterogeneous platforms and systems. Space based computing is a new middleware paradigm meeting these demands. As an example we present the real time build-up of data warehouses.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1035–1040},
numpages = {6},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315544,
author = {Kersten, Martin and Weikum, Gerhard and Franklin, Michael and Keim, Daniel and Buchmann, Alex and Chaudhuri, Surajit},
title = {A Database Striptease or How to Manage Your Personal Databases},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1043–1044},
numpages = {2},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315545,
author = {Cluet, Sophie},
title = {Who Needs XML Database?},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1045},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315546,
author = {Brodie, Michael L.},
title = {Illuminating the Dark Side of Web Services},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1046–1049},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315547,
author = {Berger, Sacha and Bry, Fran\c{c}ois and Schaffert, Sebastian and Wieser, Christoph},
title = {Xcerpt and VisXcerpt: From Pattern-Based to Visual Querying of XML and Semistructured Data},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1053–1056},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315548,
author = {Meng, Xiaofeng and Luo, Daofeng and Lee, Mong Li and An, Jing},
title = {OrientStore: A Schema Based Native XML Storage System},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1057–1060},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315549,
author = {Abiteboul, Serge and Baumgarten, J\'{e}r\^{o}me and Bonifati, Angela and Cob\'{e}na, Gr\'{e}gory and Cremarenco, Cosmin and Dragan, Florin and Manolescu, Ioana and Milo, Tova and Preda, Nicoleta},
title = {Managing Distributed Workspaces with Active XML},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1061–1064},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315550,
author = {Arion, Andrei and Bonifati, Angela and Costa, Gianni and D'Aguanno, Sandra and Manolescu, Ioana and Pugliese, Andrea},
title = {XQueC: Pushing Queries to Compressed XML Data},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1065–1068},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315551,
author = {Balmin, Andrey and Hristidis, Vagelis and Koudas, Nick and Papakonstantinou, Yannis and Srivastava, Divesh and Wang, Tianqiu},
title = {A System for Keyword Proximity Search on XML Databases},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1069–1072},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315552,
author = {Harding, Philip J. and Li, Quanzhong and Moon, Bongki},
title = {XISS/R: XML Indexing and Storage System Using RDBMS},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {We demonstrate the XISS/R system, an implementation of the XML Indexing and Storage System (XISS) on top of a relational database. The system is based on the XISS extended preorder numbering scheme, which captures the nesting structure of XML data and provides the opportunity for storage and query processing independent of the particular structure of the data. The system includes a web-based user interface, which enables stored documents to be queried via XPath. The user interface utilizes the XPath Query Engine, which automatically translates XPath queries into efficient SQL statements.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1073–1076},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315553,
author = {Fern\'{a}ndez, Mary and Sim\'{e}on, J\'{e}r\^{o}me and Choi, Byron and Marian, Am\'{e}lie and Sur, Gargi},
title = {Implementing XQuery 1.0: The Galax Experience},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Galax is a light-weight, portable, open-source implementation of XQuery 1.0. Started in December 2000 as a small prototype designed to test the XQuery static type system, Galax has now become a solid implementation, aiming at full conformance with the family of XQuery 1.0 specifications. Because of its completeness and open architecture, Galax also turns out to be a very convenient platform for researchers interested in experimenting with XQuery optimization.We demonstrate the Galax system as well as its most advanced features, including support for XPath 2.0, XML Schema and static type-checking. We also present some of our first experiments with optimization. Notably, we demonstrate query rewriting capabilities in the Galax compiler, and the ability to run queries on documents up to a Gigabyte without the need for preindexing. Although early versions of Galax have been shown in industrial conferences over the last two years, this is the first time it is demonstrated in the database community.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1077–1080},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315554,
author = {Weber, Roger and Schuler, Christoph and Neukomm, Patrick and Schuldt, Heiko and Schek, Hans-J.},
title = {Web Service Composition with O'GRAPE and OSIRIS},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1081–1084},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315555,
author = {Torlone, Riccardo and Atzeni, Paolo},
title = {Chameleon: An Extensible and Customizable Tool for Web Data Translation},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Chameleon is a tool for the management of Web data according to different formats and models and for the automatic transformation of schemas and instances from one model to another.It handles semistructured data, schema languages for XML, and traditional database models. The system is based on a "metamodel" approach, in the sense that it knows a set of metaconstructs,and allows the definition of models by means of the involved metaconstructs. The system also has a library of basic translations, referring to the known metaconstructs, and builds actual translations by means of suitable combinations of the basic ones.The main functions offered to the user are: (i) definition of a model; (ii)definition and validation of a schema with respect to a given model; (iii)schema translation (from a model to another).},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1085–1088},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315556,
author = {Nicklas, Daniela and Grossmann, Matthias and Schwarz, Thomas},
title = {NexusScout: An Advanced Location-Based Application on a Distributed, Open Mediation Platform},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {This demo shows several advanced use cases of location-based services and demonstrates how these use cases are facilitated by a mediation middleware for spatial information, the Nexus Platform. The scenario shows how a mobile user can access location-based information via so called Virtual Information Towers, register spatial events, send and receive geographical messages or find her friends by displaying other mobile users. The platform facilitates these functions by transparently combining spatial data from a dynamically changing set of data providers, tracking mobile objects and observing registered spatial events.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1089–1092},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315557,
author = {Abiteboul, S. and Amann, B. and Baumgarten, J. and Benjelloun, O. and Ngoc, F. Dang and Milo, T.},
title = {Schema-Driven Customization of Web Services},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1093–1096},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315558,
author = {Nie, Zaiqing and Kambhampati, Subbarao and Hernandez, Thomas},
title = {BibFinder/StatMiner: Effectively Mining and Using Coverage and Overlap Statistics in Data Integration},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition there are no effective approaches for learning the needed statistics. In this paper we present StatMiner, a system for estimating the coverage and overlap statistics while keeping the needed statistics tightly under control. StatMiner uses a hierarchical classification of the queries, and threshold based variants of familiar data mining techniques to dynamically decide the level of resolution at which to learn the statistics. We will demonstrate the major functionalities of StatMiner and the effectiveness of the learned statistics in BibFinder, a publicly available computer science bibliography mediator we developed. The sources that BibFinder integrates are autonomous and can have uncontrolled coverage and overlap. An important focus in BibFinder was thus to mine coverage and overlap statistics about these sources and to exploit them to improve query processing.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1097–1100},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315559,
author = {Petrovic, Milenko and Burcea, Ioana and Jacobsen, Hans-Arno},
title = {S-ToPSS: Semantic Toronto Publish/Subscribe System},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1101–1104},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315560,
author = {Sizov, Sergej and Graupmann, Jens and Theobald, Martin},
title = {From Focused Crawling to Expert Information: An Application Framework for Web Exploration and Portal Generation},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1105–1108},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315561,
author = {Li, Wen-Syan and Po, Oliver and Hsiung, Wang-Pin and Candan, K. Sel\c{c}uk and Agrawal, Divyakant and Akca, Yusuf and Taniguchi, Kunihiro},
title = {CachePortal II: Acceleration of Very Large Scale Data Center-Hosted Database-Driven Web Applications},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1109–1112},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315562,
author = {Wang, Haixun and Zaniolo, Carlo and Luo, Chang Richard},
title = {ATLAS: A Small but Complete SQL Extension for Data Mining and Data Streams},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1113–1116},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315563,
author = {Witkowski, Andrew and Bellamkonda, Srikanth and Bozkaya, Tolga and Folkert, Nathan and Gupta, Abhinav and Sheng, Lei and Subramanian, Sankar},
title = {Business Modeling Using SQL Spreadsheets},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {One of the critical deficiencies of SQL is the lack of support for array and spreadsheet like calculations which are frequent in OLAP and Business Modeling applications. Applications relying on SQL have to emulate these calculations using joins, UNION operations, Window Functions and complex CASE expressions. The designated place in SQL for algebraic calculations is the SELECT clause, which is extremely limiting and forces applications to generate queries with nested views, subqueries and complex joins. This distributes Business Modeling computations across many query blocks, making applications coded in SQL hard to develop. The limitations of RDBMS have been filled by spreadsheets and specialized MOLAP engines which are good at formulas for mathematical modeling but lack the formalism of the relational model, are difficult to manage, and exhibit scalability problems. This demo presents a scalable, mathematically rigorous, and performant SQL extensions for Relational Business Modeling, called the SQL Spreadsheet. We present examples of typical Business Modeling computations with SQL spreadsheet and compare them with the ones using standard SQL showing performance advantages and ease of programming for the former. We will show a scalability example where data is processed in parallel and will present a new class of query optimizations applicable to SQL spreadsheet.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1117–1120},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315564,
author = {Wang, Tianqiu and Santini, Simone and Gupta, Amarnath},
title = {An Interpolated Volume Data Model},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1121–1124},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315565,
author = {Lakshmanan, Laks V. S. and Pei, Jian and Zhao, Yan},
title = {Efficacious Data Cube Exploration by Semantic Summarization and Compression},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Data cube is the core operator in data warehousing and OLAP. Its efficient computation, maintenance, and utilization for query answering and advanced analysis have been the subjects of numerous studies. However, for many applications, the huge size of the data cube limits its applicability as a means for semantic exploration by the user.Recently, we have developed a systematic approach to achieve efficacious data cube construction and exploration by semantic summarization and compression. Our approach is pivoted on a notion of quotient cube that groups together structurally related data cube cells with common (aggregate) measure values into equivalence classes. The equivalence relation used to partition the cube lattice preserves the roll-up/drill-down semantics of the data cube, in that the same kind of explorations can be conducted in the quotient cube as in the original cube, between classes instead of between cells. We have also developed compact data structures for representing a quotient cube and efficient algorithms for answering queries using a quotient cube for its incremental maintenance against updates.We have implemented SOCQET, a prototype data warehousing system making use of our results on quotient cube. In this demo, we will demonstrate (1) the critical techniques of building a quotient cube; (2) use of a quotient cube to answer various queries and to support advanced OLAP; (3) an empirical study on the effectiveness and efficiency of quotient cube-based data warehouses and OLAP; (4) a user interface for visual and interactive OLAP; and (5) SOCQET, a research prototype data warehousing system integrating all the techniques. The demo reflects our latest research results and may stimulate some interesting future studies.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1125–1128},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315566,
author = {Sattler, Kai-Uwe and Geist, Ingolf and Schallehn, Eike},
title = {QUIET: Continuous Query-Driven Index Tuning},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Index tuning as part of database tuning is the task of selecting and creating indexes with the goal of reducing query processing times. However, in dynamic environments with various ad-hoc queries it is difficult to identify potential useful indexes in advance. In this demonstration, we present our tool QUIET addressing this problem. This tool "intercepts" queries and - based on a cost model as well as runtime statistics about profits of index configurations - decides about index creation automatically at runtime. In this way, index tuning is driven by queries without explicit actions of the database users.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1129–1132},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315567,
author = {Bouganim, Luc and Ngoc, Fran\c{c}ois Dang and Pucheral, Philippe and Wu, Lilan},
title = {Chip-Secured Data Access: Reconciling Access Rights with Data Encryption},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1133–1136},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315568,
author = {Nath, Suman and Deshpande, Amol and Ke, Yan and Gibbons, Phillip B. and Karp, Brad and Seshan, Srinivasan},
title = {IrisNet: An Architecture for Internet-Scale Sensing Services},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {We demonstrate the design and an early prototype of IrisNet (Internet-scale Resource-Intensive Sensor Network services), a common, scalable networked infrastructure for deploying wide area sensing services. IrisNet is a potentially global network of smart sensing nodes, with webcams or other monitoring devices, and organizing nodes that provide the means to query recent and historical sensor-based data. IrisNet exploits the fact that high-volume sensor feeds are typically attached to devices with significant computing power and storage, and running a standard operating system. It uses aggressive filtering, smart query routing, and semantic caching to dramatically reduce network bandwidth utilization and improve query response times, as we demonstrate.Our demo will present two services built on Iris-Net, from two very different application domains. The first one, a parking space finder, utilizes webcams that monitor parking spaces to answer queries such as the availability of parking spaces near a user's destination. The second one, a distributed infrastructure monitor, uses measurement tools installed in individual nodes of a large distributed infrastructure to answer queries such as average network bandwidth usage of a set of nodes.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1137–1140},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315569,
author = {Baumann, Peter},
title = {Large-Scale, Standards-Based Earth Observation Imagery and Web Mapping Services},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {Earth observation (EO) and simulation data share some core characteristics: they resemble raster data of some spatio-temporal dimensionality; the complete objects are extremely large, well into Tera- and Petabyte volumes; data generation and retrieval follow very different access patterns. EO time series additionally share that acquisition/generation happens in time slices.The central standardization body for geo service interfaces is the Open GIS Consortium (OGC). Earlier OGC has issued the Web Map Service (WMS) Interface Specification which addresses 2-D (raster and vector) maps. This year, the Web Coverage Service (WCS) Specification has been added with specific focus on 2-D and 3-D rasters ("coverages").In this paper we present operational applications offering WMS/WCS services: a 2-D ortho photo maintained by the Bavarian Mapping Agency and a 3-D satellite time series deployed by the German Aerospace Association. All are based on the rasdaman array middleware which extends relational DBMSs with storage and retrieval capabilities for extremely large multidimensional arrays.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1141–1144},
numpages = {4},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315570,
author = {Clifton, Chris and Fundulaki, Irini and Hull, Richard and Kumar, Bharat and Lieuwen, Daniel and Sahuguet, Arnaud},
title = {Privacy-Enhanced Data Management for next-Generation e-Commerce},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1147},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315571,
author = {Decker, Stefan and Kashyap, Vipul},
title = {The Semantic Web: Semantics for Data on the Web},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {In our tutorial on Semantic Web (SW) technology, we explain the why, the various technology thrusts and the relationship to database technology. The motivation behind presenting this tutorial is discussed and the framework of the tutorial along with the various component technologies and research areas related to the Semantic Web is presented.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1148},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315572,
author = {Koudas, Nick and Srivastava, Divesh},
title = {Data Stream Query Processing: A Tutorial},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1149},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315573,
author = {Jagatheesan, Arun and Moore, Reagan and Paton, Norman W. and Watson, Paul},
title = {Grid Data Management Systems & Services},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {The Grid is an emerging infrastructure for providing coordinated and consistent access to distributed, heterogeneous computational and information storage resources amongst autonomous organizations.Data grids are being built across the world as the next generation data handling systems for sharing access to data and storage systems within multiple administrative domains. A data grid provides logical name spaces for digital entities and storage resources to create global identifiers that are location independent. Data grid systems provide services on the logical name space for the manipulation, management, and organization of digital entities.Databases are increasingly being used within Grid applications for data and metadata management, and several groups are now developing services for the access and integration of structured data on the Grid. The service-based approach to making data available on the Grid is being encouraged by the adoption of the Open Grid Services Architecture (OGSA), which is bringing about the integration of the Grid with Web Service technologies.The tutorial will introduce the Grid, and examine the requirements, issues and possible solutions for integrating data into the Grid. It will take examples from current systems, in particular the SDSC Storage Resource Broker and the OGSA-Database Access and Integration project.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1150},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

@inproceedings{10.5555/1315451.1315574,
author = {Ceri, Stefano and Manolescu, Ioana},
title = {Constructing and Integrating Data-Centric Web Applications: Methods, Tools, and Techniques},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {This tutorial deals with the construction of data-centric Web applications, focusing on the modelling of processes and on the integration with Web services. The tutorial describes the standards, methods, and tools that are commonly used for building these applications.},
booktitle = {Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29},
pages = {1151},
numpages = {1},
location = {Berlin, Germany},
series = {VLDB '03}
}

license: Unlicense

repository: goyalkaraniit/acm-cr

license_type: permissive

repo_name: goyalkaraniit/acm-cr

branch_name: refs/heads/main

extension: bib


text:
DESCRIPTION = "NVIDIA CUDA 6.5 Toolkit for L4T Rel 21.x Packages"
HOMEPAGE = "https://developer.nvidia.com/"
LICENSE = "Proprietary"

SRC_URI = "http://developer.download.nvidia.com/embedded/L4T/r21_Release_v3.0/cuda-repo-l4t-r21.3-6-5-prod_6.5-42_armhf.deb"

LIC_FILES_CHKSUM = "file://usr/share/doc/cuda-repo-l4t-r21.3-6-5-prod/copyright;md5=f87877410d6936081b0b8ddd124ca96d"

SRC_URI[md5sum] = "7652f8afcd01e5c82dc5c202a902469a"
SRC_URI[sha256sum] = "010ea3ba7b5afce62488a9c19f4854444962e4421510cb9dc39c548fc577d41e"

PR = "r0"

DEPENDS = " "

INSANE_SKIP_${PN} = "ldflags"

PACKAGE_ARCH = "${MACHINE_ARCH}"

S = "${WORKDIR}/cuda6.5"

INSANE_SKIP_${PN}-dev = "ldflags"

FILES_${PN} =  "${datadir}/lintian/* \
                ${base_prefix}/usr/local/cuda-6.5/* "

INHIBIT_PACKAGE_STRIP = "1"

INSANE_SKIP_${PN} += "dev-so"

python do_unpack () {
    locals = d.getVar('WORKDIR')
    d.setVar('WORKDIR', '${WORKDIR}/cuda6.5')
    d.setVar('S', '${WORKDIR}')
    bb.build.exec_func('base_do_unpack', d)
    d.setVar('WORKDIR', locals)
}

do_install () {
    cp -r ${WORKDIR}/cuda6.5/usr ${D}
    dpkg -x ${WORKDIR}/cuda6.5/var/cuda-repo-6-5-prod/cuda-cudart-6-5_6.5-42_armhf.deb ${D}
}

license: MIT

branch_name: refs/heads/jethro

gha_language: BitBake

extension: bb


text:
@InProceedings{servedio12,
  title = {Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions},
  author = {Rocco   Servedio and Li-Yang Tan and Justin Thaler},
  pages = {14.1--14.19},
  abstract = {We study the challenging problem of learning decision lists attribute-efficiently, giving both positive and negative results. Our main positive result is a new tradeoff between the running time and mistake bound for learning length-\emph{k} decision lists over \emph{n} Boolean variables. When the allowed running time is relatively high, our new mistake bound improves significantly on the mistake bound of the best previous algorithm of Klivans and Servedio (Klivans and Servedio, 2006). Our main negative result is a new lower bound on the \emph{weight} of any degree-\emph{d} polynomial threshold function (PTF) that computes a particular decision list over \emph{k} variables (the ``ODD-MAX-BIT'' function). The main result of Beigel (Beigel, 1994) is a weight lower bound of 2^{Ω(\emph{k}/\emph{d}^{2})}, which was shown to be essentially optimal for \emph{d} ≤ \emph{k}^{1/3} by Klivans and Servedio. Here we prove a 2^{Ω(√\emph{k/d})}  lower bound, which improves on Beigel's lower bound for \emph{d} > \emph{k}^{1/3}. This lower bound establishes strong limitations on the effectiveness of the Klivans and Servedio approach and suggests that it may be difficult to improve on our positive result. The main tool used in our lower bound is a new variant of Markov's classical inequality which may be of independent interest; it provides a bound on the derivative of a univariate polynomial in terms of both its degree \emph{and} the size of its coefficients.},
  pdf = {http://jmlr.org/proceedings/papers/v23/servedio12/servedio12.pdf},
}

repository: mreid/papersite

repo_name: mreid/papersite

branch_name: refs/heads/master

gha_license_id: MIT

gha_language: TeX


text:
@Article{sanchez-costa_contrasting_2015,
  author = {Elisenda S{\a'a}nchez-Costa and Rafael Poyatos and Santiago Sabat{\a'e}},
  title = {Contrasting growth and water use strategies in four co-occurring Mediterranean tree species revealed by concurrent measurements of sap flow and stem diameter variations},
  journal = {Agricultural and Forest Meteorology},
  volume = {207},
  pages = {24--37},
  year = {2015},
  keywords = {Automatic dendrometer, Growth-based water use efficiency, Tree transpiration, tree water deficit, water availability},
  doi = {10.1016/j.agrformet.2015.03.012},
  url = {http://www.sciencedirect.com/science/article/pii/S0168192315000908},
  note = {00005},
  abstract = {Drought limits tree water use and growth of Mediterranean trees. However, growth and water use strategies are rarely addressed simultaneously across species and drought conditions. Here, we investigate the link between stem diameter variations and sap flow in four co-existing Mediterranean trees (Pinus halepensis Mill., Quercus pubescens Willd., Quercus ilex L. and Arbutus unedo L.), under relatively wet (2011) and dry (2012) conditions. Continuous stem diameter variations were converted to basal area increment (BAI) and de-trended to estimate tree water deficit (ΔW), an indicator of stem hydration. P. halepensis and Q. pubescens showed the most and the least conservative sap flow density (JS) regulation under drought, respectively, with Q. ilex and A.unedo showing intermediate drought responses. All species, except A. unedo, showed some between-year variability in the environmental control of JS. Seasonal stem shrinkage in response to drought (i.e., increasing ΔW) and subsequent trunk rehydration after rainfall (i.e., decreasing ΔW) occurred in all species. Vapor pressure deficit (VPD) and soil moisture (θ) interacted to determine seasonal variation in ΔW. Interestingly, in the dry year, 2012, more species-specific differences were found in the responses of ΔW to θ and VPD. Across species, JS and ΔW began to decline at similar soil moisture thresholds, underpinning the tight link between JS and ΔW under varying drought conditions. Annual BAI decreased proportionally more than tree-level transpiration (JT) between the wet (2011) and the dry (2012) year, hence growth-based WUE (WUEBAI = BAI/JT) decreased for all species, albeit less acutely for P. halepensis. Overall, despite their contrasting leaf habit and wood type, the studied Mediterranean tree species show coordinated responses of transpiration, water storage dynamics and growth-based WUE which allow them to cope with seasonal and interannual drought.},
  file = {Sánchez-Costa_2015_Contrasting growth and water use strategies in four co-occurring Mediterranean.pdf:/media/rafap/Data/Documents/Zotero/storage/99DJ77ZT/Sánchez-Costa_2015_Contrasting growth and water use strategies in four co-occurring Mediterranean.pdf:application/pdf},
  issn = {0168-1923},
  urldate = {2016-04-11},
  month = {jul},
  pubtype = {2},
  date = {2015-01-01},
}

repository: rafapoyatos/academic-kickstart

repo_name: rafapoyatos/academic-kickstart


text:
require qemu-devicetrees.inc

XILINX_RELEASE_VERSION = "v2017.3"
SRCREV ?= "4b951c594078562e9dd828430075968dd91ac425"

repository: sandeshghimire/xilinx-yocto

repo_name: sandeshghimire/xilinx-yocto

gha_language: Python


text:
@INPROCEEDINGS{mengelkamp2017,
author={E. {Mengelkamp} and P. {Staudt} and J. {Garttner} and C. {Weinhardt}},
booktitle={{2017 14th International Conference on the European Energy Market (EEM)}},
title={Trading on local energy markets: A comparison of market designs and bidding strategies},
year={2017},
volume={},
number={},
pages={1-6},
abstract={Increasing renewable energy sources and innovative information and communication systems open up new challenges and opportunities to integrate distributed generation into the energy supply system. Formerly centralized energy systems need to be adapted to take full advantage of the immense potential of decentralized energy generation and smart, interconnected energy end users. We introduce a local electricity market on which prosumers and consumers of a community are able to trade electricity directly amongst each other. This local electricity market supports the local integration of renewable energy generation. It facilitates a local balance of energy supply and demand and hence reduces the need for extensive electricity transmission. We introduce, evaluate and compare two local market designs, a direct peer-to-peer market and a closed order book market, as well as two agent behaviors, zero-intelligence agents and intelligently bidding agents. We derive four scenarios by combining each market design with each agent behavior, respectively. All market scenarios offer similar economic advantages for the market participants. However, the peer-to-peer market with intelligent agents appears to be the most advantageous as it results in the lowest average overall electricity price.},
keywords={power markets;tendering;local energy markets;renewable energy sources;distributed generation;energy supply system;decentralized energy generation;energy end users;local electricity market;renewable energy generation;direct peer-to-peer market;closed order book market;zero-intelligence agents;intelligently bidding agents;Electricity supply industry;Peer-to-peer computing;Renewable energy sources;Supply and demand;Intelligent agents;Distributed power generation;Electric potential;Local energy markets;market design;agent behavior},
doi={10.1109/EEM.2017.7981938},
ISSN={2165-4093},
month={June},}

@INPROCEEDINGS{horta2017,
author={J. {Horta} and D. {Kofman} and D. {Menga} and A. {Silva}},
booktitle={{2017 IEEE International Conference on Smart Grid Communications (SmartGridComm)}},
title={Novel market approach for locally balancing renewable energy production and flexible demand},
year={2017},
volume={},
number={},
pages={533-539},
abstract={Future electricity distribution grids will host a considerable share of variable renewable energy sources and local storage resources. Moreover, they will face new load structures due for example to the growth of the electric vehicle market. These trends raise the need for new paradigms for distribution grids operation, in which Distribution System Operators will increasingly rely on demand side flexibility and households will progressively become prosumers playing an active role on smart grid energy management. However, in present energy management architectures, the lack of coordination among actors limits the capability of the grid to enable the mentioned trends. In this paper we tackle this problem by proposing an architecture that enables households to autonomously exchange energy blocks and flexibility services with neighbors, operators and market actors. The solution is based on a blockchain transactive platform. We focus on a market application, where households can trade energy with their neighbors, aimed to locally balancing renewable energy production. We propose a market mechanism and dynamic transport prices that provide an incentive for households to locally manage energy resources in a way that responds to both prosumer and operator needs. We evaluate the impact of such markets through comprehensive simulations using power flow analysis and realistic load profiles, providing valuable insight for the design of appropriate mechanisms and incentives.},
keywords={demand side management;energy management systems;power markets;pricing;renewable energy sources;smart power grids;renewable energy production;flexible demand;variable renewable energy sources;local storage resources;load structures;electric vehicle market;distribution grids operation;Distribution System Operators;demand side flexibility;households;smart grid energy management;energy management architectures;energy blocks;flexibility services;market actors;market application;energy resources;operator needs;market approach;electricity distribution grids;Renewable energy sources;Batteries;Production;Contracts;Smart grids;Measurement;Conferences},
doi={10.1109/SmartGridComm.2017.8340728},
ISSN={},
month={Oct},}

@INPROCEEDINGS{kiedanski2019,
author={D. {Kiedanski} and D. {Kofman} and J. {Horta} and D. {Menga}},
booktitle={{2019 IEEE Power Energy Society Innovative Smart Grid Technologies Conference (ISGT)}},
title={Strategy-proof local energy market with sequential stochastic decision process for battery control},
year={2019},
volume={},
number={},
pages={1-5},
abstract={Low voltage distribution networks were not designed to support massive deployment of distributed energy resources (DER) such as solar panels, which is currently hindering the Energy Transition. Recent research contributions have shown that local energy markets improve the capacity of distribution grids to host DER. In parallel, distributed models were created to deal with the control of batteries in presence of stochastic demand and production, as well as variable electricity prices. The combination of the two techniques has received little attention until now, from both the literature and the industry. In this paper we extend the traditional approach to sequential stochastic decision processes by also modeling the interaction with the neighborhood in addition to the utility. The model is then solved using reinforcement learning techniques. For the local energy market we use MUDA: a strategy-proof multi-unit double auction. The performance of the proposed system is evaluated through simulations, demonstrating its capacity to effectively decrease the overall exchange of energy with the grid and the monetary cost for users.},
keywords={learning (artificial intelligence);power engineering computing;power grids;power markets;secondary cells;stochastic processes;strategy-proof local energy market;sequential stochastic decision process;battery control;distribution grids;distributed models;stochastic demand;variable electricity prices;strategy-proof multiunit double auction;energy transition;reinforcement learning techniques;Batteries;Stochastic processes;Production;Renewable energy sources;Reinforcement learning;Optimization;Mathematical model;ADP;Battery;Smart Grid;Energy Market;Auction},
doi={10.1109/ISGT.2019.8791585},
ISSN={2167-9665},
month={Feb},}

@article{blouin2001decentralized,
    author = {Blouin, Max R. and Serrano, Roberto},
    title = "{A Decentralized Market with Common Values Uncertainty: Non-Steady States}",
    journal = {The Review of Economic Studies},
    volume = {68},
    number = {2},
    pages = {323-346},
    year = {2001},
    month = {04},
    abstract = "{We analyse a market where (i) trade proceeds by random and anonymous pairwise meetings with bargaining; (ii) agents are asymmetrically informed about the value of the traded good; and (iii) no new entrants are allowed once the market is open. We show that information revelation and efficiency never obtain in equilibrium, even as discounting is removed. This holds whether the asymmetry is two-sided or one-sided. In some cases there exist equilibria where a substantial amount goes untraded. This contrasts with the earlier literature, which was based on the steadystate equilibria of a model where agents enter the market every period.}",
    issn = {0034-6527},
    doi = {10.1111/1467-937X.00171},
    url = {https://doi.org/10.1111/1467-937X.00171},
    eprint = {https://academic.oup.com/restud/article-pdf/68/2/323/4369413/68-2-323.pdf},
}

@inproceedings{segal2018muda,
  title={MUDA: a truthful multi-unit double-auction mechanism},
  author={Segal-Halevi, Erel and Hassidim, Avinatan and Aumann, Yonatan},
  booktitle={{Thirty-Second AAAI Conference on Artificial Intelligence}},
  year={2018}
}

@article{huangauction,
author = {Huang, Pu and Scheller–Wolf, Alan and Sycara, Katia},
title = {Design of a Multi–Unit Double Auction E–Market},
journal = {Computational Intelligence},
volume = {18},
number = {4},
pages = {596-617},
keywords = {electronic market, auction, mechanism design, multi–agent system, market clearing},
doi = {10.1111/1467-8640.t01-1-00206},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/1467-8640.t01-1-00206},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1111/1467-8640.t01-1-00206},
abstract = {We envision a future economy where e–markets will play an essential role as exchange hubs for commodities and services. Future e–markets should be designed to be robust to manipulation, flexible, and sufficiently efficient in facilitating exchanges. One of the most important aspects of designing an e–market is market mechanism design. A market mechanism defines the organization, information exchange process, trading procedure, and clearance rules of a market. If we view an e–market as a multi–agent system, the market mechanism also defines the structure and rules of the environment in which agents (buyers and sellers) play the market game. We design an e–market mechanism that is strategy–proof with respect to reservation price, weakly budget–balanced, and individually rational. Our mechanism also makes sellers unlikely to underreport the supply volume to drive up the market price. In addition, by bounding our market’s efficiency loss, we provide fairly unrestrictive sufficient conditions for the efficiency of our mechanism to converge in a strong sense when (1) the number of agents who successfully trade is large, or (2) the number of agents, trading and not, is large. We implement our design using the RETSINA infrastructure, a multi–agent system development toolkit. This enables us to validate our analytically derived bounds by numerically testing our e–market.},
year = {2002}
}

@Article{simulation,
author = { Carl Chiarella and Giulia Iori },
title = {A simulation analysis of the microstructure of double auction markets},
journal = {Quantitative Finance},
volume = {2},
number = {5},
pages = {346-353},
year = {2002},
publisher = {Routledge},
doi = {10.1088/1469-7688/2/5/303},
URL = {https://www.tandfonline.com/doi/abs/10.1088/1469-7688/2/5/303},
eprint = {https://www.tandfonline.com/doi/pdf/10.1088/1469-7688/2/5/303},
abstract = { Abstract We introduce an order-driven market model with heterogeneous agents trading via a central order matching mechanism. Traders set bids and asks and post market or limit orders according to exogenously fixed rules. We investigate how different trading strategies may affect the dynamics of price, bid-ask spreads, trading volume and volatility. We also analyse how some features of market design, such as tick size and order lifetime, affect market liquidity. The model is able to reproduce many of the complex phenomena observed in real stock markets. *Paper presented at Applications of Physics in Financial Analysis (APFA) 3, 5–7 December 2001, Museum of London, UK. }}

@Article{builder,
author = { B. LeBaron },
title = {A builder's guide to agent-based financial markets},
journal = {Quantitative Finance},
volume = {1},
number = {2},
pages = {254-261},
year = {2001},
publisher = {Routledge},
doi = {10.1088/1469-7688/1/2/307},
URL = { https://doi.org/10.1088/1469-7688/1/2/307},
eprint = { https://doi.org/10.1088/1469-7688/1/2/307},
abstract = { This paper is intended to guide researchers interested in building their own agent-based financial markets. Key design questions are outlined, along with some of the major controversies about which directions to take. }
}

repository: geovsol/pymarket

repo_name: geovsol/pymarket