Contact The DL Team Contact Us | Switch to tabbed view

top of pageABSTRACT

Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an order-preserving encryption scheme for numeric data that allows any comparison operation to be directly applied on encrypted data. Query results produced are sound (no false hits) and complete (no false drops). Our scheme handles updates gracefully and new values can be added without requiring changes in the encryption of other values. It allows standard databse indexes to be built over encrypted tables and can easily be integrated with existing database systems. The proposed scheme has been designed to be deployed in application environments in which the intruder can get access to the encrypted database, but does not have prior domain information such as the distribution of values and annot encrypt or decrypt arbitrary values of his choice. The encryption is robust against estimation of the true value in such environments.
Advertisements



top of pageAUTHORS



Author image not provided  Rakesh Agrawal

No contact information provided yet.

Bibliometrics: publication history
Publication years1983-2016
Publication count174
Citation Count17,724
Available for download90
Downloads (6 Weeks)1,078
Downloads (12 Months)15,478
Downloads (cumulative)115,160
Average downloads per article1,279.56
Average citations per article101.86
View colleagues of Rakesh Agrawal


Author image not provided  Jerry Kiernan

No contact information provided yet.

Bibliometrics: publication history
Publication years1990-2009
Publication count27
Citation Count863
Available for download15
Downloads (6 Weeks)71
Downloads (12 Months)647
Downloads (cumulative)15,135
Average downloads per article1,009.00
Average citations per article31.96
View colleagues of Jerry Kiernan


Ramakrishnan Srikant Ramakrishnan Srikant

www.rsrikant.com
Bibliometrics: publication history
Publication years1994-2015
Publication count42
Citation Count9,465
Available for download24
Downloads (6 Weeks)235
Downloads (12 Months)2,901
Downloads (cumulative)41,437
Average downloads per article1,726.54
Average citations per article225.36
View colleagues of Ramakrishnan Srikant


Author image not provided  Yirong Xu

No contact information provided yet.

Bibliometrics: publication history
Publication years2002-2005
Publication count9
Citation Count589
Available for download7
Downloads (6 Weeks)45
Downloads (12 Months)440
Downloads (cumulative)6,906
Average downloads per article986.57
Average citations per article65.44
View colleagues of Yirong Xu

top of pageREFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
G. Bebek. Anti-tamper database research: Inference control techniques. Technical Report EECS 433 Final Report, Case Western Reserve University, November 2002.
 
4
 
5
6
 
7
 
8
J. Domingo-Ferrer and J. Herrera-Joancomarti. A privacy homomorphism allowing field operations on encrypted data. I Jornades de Matematica Discreta i Algorismica, Universitat Politecnica de Catalunya, March 1998.
 
9
 
10
J. Feigenbaum, M. Y. Liberman, and R. N. Wright. Cryptographic protection of databases and software. In Proc. of the DIMACS Workshop on Distributed Computing and Cryptography, 1990.
11
 
12
S. C. Gultekin Ozsoyoglu, David Singer. Anti-tamper databases: Querying encrypted databases. In Proc. of the 17th Annual IFIP WG 11.3 Working Conference on Database and Applications Security, Estes Park, Colorado, August 2003.
13
 
14
T. Hamilton. Error sends bank files to eBay. The Toronto Star, September 15, 2003.
 
15
 
16
 
17
 
18
Oracle Corporation. Database Encryption in Oracle 8i, August 2000.
 
19
 
20
 
21
R. L. Rivest, L. Adelman, and M. L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, pages 169--178, 1978.
 
22
B. Schneier. Applied Cryptography. John Wiley, second edition, 1996.
 
23
 
24
 
25

top of pageCITED BY

165 Citations

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

top of pageINDEX TERMS

Index Terms are not available

top of pagePUBLICATION

Title SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Conference Chairs Arnd Christian König Microsoft Research
Stefan Dessloch University of Kaiserslautern, Germany
General Chairs Patrick Valduriez INRIA, France
Program Chairs Gerhard Weikum University of the Saarland
Pages 563-574
Publication Date2004-06-13 (yyyy-mm-dd)
Sponsor SIGMOD ACM Special Interest Group on Management of Data
PublisherACM New York, NY, USA ©2004
ISBN: 1-58113-859-8 Order Number: ACM Order No.: 472040 doi>10.1145/1007568.1007632
Conference MODInternational Conference on Management of Data MOD logo
Overall Acceptance Rate 1,104 of 5,662 submissions, 19%
Year Submitted Accepted Rate
SIGMOD '96 290 47 16%
SIGMOD '97 202 42 21%
SIGMOD '00 248 42 17%
SIGMOD '01 293 44 15%
SIGMOD '02 240 42 18%
SIGMOD '03 342 53 15%
SIGMOD '06 446 58 13%
SIGMOD '07 480 70 15%
SIGMOD '08 435 78 18%
SIGMOD '09 430 118 27%
SIGMOD '10 384 80 21%
SIGMOD '11 375 93 25%
SIGMOD '12 289 48 17%
SIGMOD '13 372 76 20%
SIGMOD '14 421 107 25%
SIGMOD '15 415 106 26%
Overall 5,662 1,104 19%

APPEARS IN
Digital Content

top of pageREVIEWS


Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Table of Contents
SESSION: Keynote talks
The next database revolution
Jim Gray
Pages: 1-4
doi>10.1145/1007568.1007570
Full text: PDFPDF

Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database system. This gives an extensible object-relational system where non-procedural ...
expand
The role of cryptography in database security
Ueli Maurer
Pages: 5-10
doi>10.1145/1007568.1007571
Full text: PDFPDF

In traditional database security research, the database is usually assumed to be trustworthy. Under this assumption, the goal is to achieve security against external attacks (e.g. from hackers) and possibly also against users trying to obtain information ...
expand
SESSION: Research sessions: stream management
Adaptive stream resource management using Kalman Filters
Ankur Jain, Edward Y. Chang, Yuan-Fang Wang
Pages: 11-22
doi>10.1145/1007568.1007573
Full text: PDFPDF

To answer user queries efficiently, a stream management system must handle continuous, high-volume, possibly noisy, and time-varying data streams. One major research area in stream management seeks to allocate resources (such as network bandwidth and ...
expand
Online event-driven subsequence matching over financial data streams
Huanmei Wu, Betty Salzberg, Donghui Zhang
Pages: 23-34
doi>10.1145/1007568.1007574
Full text: PDFPDF

Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online subsequence similarity matching over massive data streams. With a simultaneous ...
expand
Holistic UDAFs at streaming speeds
Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava
Pages: 35-46
doi>10.1145/1007568.1007575
Full text: PDFPDF

Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what techniques are required to incorporate these algorithms in a data stream ...
expand
SESSION: Research sessions: XML query efficiency
BLAS: an efficient XPath processing system
Yi Chen, Susan B. Davidson, Yifeng Zheng
Pages: 47-58
doi>10.1145/1007568.1007577
Full text: PDFPDF

We present BLAS, a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses P-labeling to process queries involving consecutive child axes, and D-labeling to process queries involving descendant axes traversal. ...
expand
Efficient processing of XML twig queries with OR-predicates
Haifeng Jiang, Hongjun Lu, Wei Wang
Pages: 59-70
doi>10.1145/1007568.1007578
Full text: PDFPDF

An XML twig query, represented as a labeled tree, is essentially a complex selection predicate on both structure and content of an XML document. Twig query matching has been identified as a core operation in querying tree-structured XML data. A number ...
expand
Tree logical classes for efficient evaluation of XQuery
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmanan, H. V. Jagadish
Pages: 71-82
doi>10.1145/1007568.1007579
Full text: PDFPDF

XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically manipulates sets of objects with identical structure. A set of XML elements, ...
expand
SESSION: Research sessions: Web, XML and IR
FleXPath: flexible structure and full-text querying for XML
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank Pandit
Pages: 83-94
doi>10.1145/1007568.1007581
Full text: PDFPDF

Querying XML data is a well-explored topic with powerful database-style query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for querying XML documents is full-text search on textual content. In this paper, ...
expand
An interactive clustering-based approach to integrating source query interfaces on the deep Web
Wensheng Wu, Clement Yu, AnHai Doan, Weiyi Meng
Pages: 95-106
doi>10.1145/1007568.1007582
Full text: PDFPDF

An increasing number of data sources now become available on the Web, but often their contents are only accessible through query interfaces. For a domain of interest, there often exist many such sources with varied coverage or querying capabilities. ...
expand
Understanding Web query interfaces: best-effort parsing with hidden syntax
Zhen Zhang, Bin He, Kevin Chen-Chuan Chang
Pages: 107-118
doi>10.1145/1007568.1007583
Full text: PDFPDF

Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases, the very first challenge is to understand what a query interface says- or what query ...
expand
Using the structure of Web sites for automatic segmentation of tables
Kristina Lerman, Lise Getoor, Steven Minton, Craig Knoblock
Pages: 119-130
doi>10.1145/1007568.1007584
Full text: PDFPDF

Many Web sites, especially those that dynamically generate HTML pages to display the results of a user's query, present information in the form of list or tables. Current tools that allow applications to programmatically extract this information rely ...
expand
SESSION: Research sessions: data mining applications
Identifying similarities, periodicities and bursts for online search queries
Michail Vlachos, Christopher Meek, Zografoula Vagena, Dimitrios Gunopulos
Pages: 131-142
doi>10.1145/1007568.1007586
Full text: PDFPDF

We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., 'Thanksgiving' or 'Christmas gifts') where the elements of the time series ...
expand
FARMER: finding interesting rule groups in microarray datasets
Gao Cong, Anthony K. H. Tung, Xin Xu, Feng Pan, Jiong Yang
Pages: 143-154
doi>10.1145/1007568.1007587
Full text: PDFPDF

Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most existing association rule mining algorithms are unable to efficiently handle ...
expand
Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data
Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
Pages: 155-166
doi>10.1145/1007568.1007588
Full text: PDFPDF

Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic location; source and destination IP addresses). Providing an aggregate view ...
expand
Cost-based labeling of groups of mass spectra
Lei Chen, Zheng Huang, Raghu Ramakrishnan
Pages: 167-178
doi>10.1145/1007568.1007589
Full text: PDFPDF

We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically for analysis of atmospheric aerosols, but with natural applications to market-basket ...
expand
SESSION: Research sessions: non-standard query processing
Optimization of query streams using semantic prefetching
Ivan T. Bowman, Kenneth Salem
Pages: 179-190
doi>10.1145/1007568.1007591
Full text: PDFPDF

Streams of relational queries submitted by client applications to database servers contain patterns that can be used to predict future requests. We present the Scalpel system, which detects these patterns and optimizes request streams using context-based ...
expand
Buffering databse operations for enhanced instruction cache performance
Jingren Zhou, Kenneth A. Ross
Pages: 191-202
doi>10.1145/1007568.1007592
Full text: PDFPDF

As more and more query processing work can be done in main memory access is becoming a significant cost component of database operations. Recent database research has shown that most of the memory stalls are due to second-level cache data misses and ...
expand
Rank-aware query optimization
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey Scott Vitter, Ahmed K. Elmagarmid
Pages: 203-214
doi>10.1145/1007568.1007593
Full text: PDFPDF

Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank aggregation algorithms. Rank-join operators progressively rank the join ...
expand
Fast computation of database operations using graphics processors
Naga K. Govindaraju, Brandon Lloyd, Wei Wang, Ming Lin, Dinesh Manocha
Pages: 215-226
doi>10.1145/1007568.1007594
Full text: PDFPDF

We present new algorithms for performing fast computation of several common database operations on commodity graphics processors. Specifically, we consider operations such as conjunctive selections, aggregations, and semi-linear queries, which are essential ...
expand
SESSION: Research sessions: new styles of XML
Lazy query evaluation for Active XML
Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, Ioana Manolescu, Tova Milo, Nicoleta Preda
Pages: 227-238
doi>10.1145/1007568.1007596
Full text: PDFPDF

In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML documents whose content is given partly extensionally, by explicit data elements, ...
expand
Data stream management for historical XML data
Sujoe Bose, Leonidas Fegaras
Pages: 239-250
doi>10.1145/1007568.1007597
Full text: PDFPDF

We are presenting a framework for continuous querying of time-varying streamed XML data. A continuous stream in our framework consists of a finite XML document followed by a continuous stream of updates. The unit of update is an XML fragment, which can ...
expand
Colorful XML: one hierarchy isn't enough
H. V. Jagadish, Laks V. S. Lakshmanan, Monica Scannapieco, Divesh Srivastava, Nuwee Wiwatwattana
Pages: 251-262
doi>10.1145/1007568.1007598
Full text: PDFPDF

XML has a tree-structured data model, which is used to uniformly represent structured as well as semi-structured data, and also enable concise query specification in XQuery, via the use of its XPath (twig) patterns. This in turn can leverage the recently ...
expand
Approximate XML query answers
Neoklis Polyzotis, Minos Garofalakis, Yannis Ioannidis
Pages: 263-274
doi>10.1145/1007568.1007599
Full text: PDFPDF

The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over the Internet or in large corporate data-stores. Inevitably, this will result ...
expand
SESSION: Research sessions: statistics
A bi-level Bernoulli scheme for database sampling
Peter J. Haas, Christian König
Pages: 275-286
doi>10.1145/1007568.1007601
Full text: PDFPDF

Current database sampling methods give the user insufficient control when processing ISO-style sampling queries. To address this problem, we provide a bi-level Bernoulli sampling scheme that combines the row-level and page-level sampling methods currently ...
expand
Effective use of block-level sampling in statistics estimation
Surajit Chaudhuri, Gautam Das, Utkarsh Srivastava
Pages: 287-298
doi>10.1145/1007568.1007602
Full text: PDFPDF

Block-level sampling is far more efficient than true uniform-random sampling over a large database, but prone to significant errors if used to create database statistics. In this paper, we develop principled approaches to overcome this limitation of ...
expand
Online maintenance of very large random samples
Christopher Jermaine, Abhijit Pol, Subramanian Arumugam
Pages: 299-310
doi>10.1145/1007568.1007603
Full text: PDFPDF

Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and not how to compute one. The implicit assumption is that ...
expand
Conditional selectivity for statistics on query expressions
Nicolas Bruno, Surajit Chaudhuri
Pages: 311-322
doi>10.1145/1007568.1007604
Full text: PDFPDF

Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during optimization, statistics on query expressions (SITs) have been previously proposed. ...
expand
SESSION: Research sessions: indexing and tuning
Transaction support for indexed summary views
Goetz Graefe, Michael Zwilling
Pages: 323-334
doi>10.1145/1007568.1007606
Full text: PDFPDF

Materialized views have become a standard technique for performance improvement in decision support databases and for a variety of monitoring purposes. In order to avoid inconsistencies and thus unpredictable query results, materialized views and their ...
expand
Graph indexing: a frequent structure-based approach
Xifeng Yan, Philip S. Yu, Jiawei Han
Pages: 335-346
doi>10.1145/1007568.1007607
Full text: PDFPDF

Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via ...
expand
The Priority R-tree: a practically efficient and worst-case optimal R-tree
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
Pages: 347-358
doi>10.1145/1007568.1007608
Full text: PDFPDF

We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1 1/d + T/B) I/Os, where N is the number of d-dimensional (hyper-) rectangles stored in the R-tree, B ...
expand
Integrating vertical and horizontal partitioning into automated physical database design
Sanjay Agrawal, Vivek Narasayya, Beverly Yang
Pages: 359-370
doi>10.1145/1007568.1007609
Full text: PDFPDF

In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a relational database system that significantly impact performance. Horizontal partitioning also provides manageability; database ...
expand
SESSION: Research sessions: data integration
Constraint-based XML query rewriting for data integration
Cong Yu, Lucian Popa
Pages: 371-382
doi>10.1145/1007568.1007611
Full text: PDFPDF

We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at the sources. The schemas can be any combination of relational or XML schemas, ...
expand
iMAP: discovering complex semantic matches between database schemas
Robin Dhamankar, Yoonkyong Lee, AnHai Doan, Alon Halevy, Pedro Domingos
Pages: 383-394
doi>10.1145/1007568.1007612
Full text: PDFPDF

Creating semantic matches between disparate data sources is fundamental to numerous data sharing efforts. Manually creating matches is extremely tedious and error-prone. Hence many recent works have focused on automating the matching process. To date, ...
expand
Adapting to source properties in processing data integration queries
Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
Pages: 395-406
doi>10.1145/1007568.1007613
Full text: PDFPDF

An effective query optimizer finds a query plan that exploits the characteristics of the source data. In data integration, little is known in advance about sources' properties, which necessitates the use of adaptive query processing techniques ...
expand
SESSION: Research sessions: stream QP
Adaptive ordering of pipelined stream filters
Shivnath Babu, Rajeev Motwani, Kamesh Munagala, Itaru Nishizawa, Jennifer Widom
Pages: 407-418
doi>10.1145/1007568.1007615
Full text: PDFPDF

We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications and capture a large class of multiway stream joins. We focus on ...
expand
Static optimization of conjunctive queries with sliding windows over infinite streams
Ahmed M. Ayad, Jeffrey F. Naughton
Pages: 419-430
doi>10.1145/1007568.1007616
Full text: PDFPDF

We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of optimization should be to find an execution plan that minimizes resource ...
expand
Dynamic plan migration for continuous queries over data streams
Yali Zhu, Elke A. Rundensteiner, George T. Heineman
Pages: 431-442
doi>10.1145/1007568.1007617
Full text: PDFPDF

Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for stream monitoring systems where long-running queries may have to withstand ...
expand
SESSION: Research sessions: clustering
Clustering objects on a spatial network
Man Lung Yiu, Nikos Mamoulis
Pages: 443-454
doi>10.1145/1007568.1007619
Full text: PDFPDF

Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. The distance between two objects is defined by their shortest path distance ...
expand
Computing Clusters of Correlation Connected objects
Christian Böhm, Karin Kailing, Peer Kröger, Arthur Zimek
Pages: 455-466
doi>10.1145/1007568.1007620
Full text: PDFPDF

The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the features or some association of cause and effect between them. This association ...
expand
Incremental and effective data summarization for dynamic hierarchical clustering
Samer Nassar, Jörg Sander, Corrine Cheng
Pages: 467-478
doi>10.1145/1007568.1007621
Full text: PDFPDF

Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to compress very large static databases into representative points suitable ...
expand
SESSION: Research sessions: XML PubSub and indexing
Implementing a scalable XML publish/subscribe system using relational database systems
Feng Tian, Berthold Reinwald, Hamid Pirahesh, Tobias Mayr, Jussi Myllymaki
Pages: 479-490
doi>10.1145/1007568.1007623
Full text: PDFPDF

An XML publish/subscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier ...
expand
Incremental maintenance of XML structural indexes
Ke Yi, Hao He, Ioana Stanoi, Jun Yang
Pages: 491-502
doi>10.1145/1007568.1007624
Full text: PDFPDF

Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many structural indexes have been proposed. The most popular ones are the 1-index, ...
expand
Incremental evaluation of schema-directed XML publishing
Philip Bohannon, Byron Choi, Wenfei Fan
Pages: 503-514
doi>10.1145/1007568.1007625
Full text: PDFPDF

When large XML documents published from a database are maintained externally, it is inefficient to repeatedly recompute them when the database is updated. Vastly preferable is incremental update, as common for views stored in a data warehouse. However, ...
expand
SESSION: Research sessions: P2P and sensor networks
The price of validity in dynamic networks
Mayank Bawa, Aristides Gionis, Hector Garcia-Molina, Rajeev Motwani
Pages: 515-526
doi>10.1145/1007568.1007627
Full text: PDFPDF

Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with short-lived hosts being the norm rather than an exception. In recent years, ...
expand
Compressing historical information in sensor networks
Antonios Deligiannakis, Yannis Kotidis, Nick Roussopoulos
Pages: 527-538
doi>10.1145/1007568.1007628
Full text: PDFPDF

We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order to perform complex monitoring and computational tasks. Such networks pose ...
expand
Efficient query reformulation in peer data management systems
Igor Tatarinov, Alon Halevy
Pages: 539-550
doi>10.1145/1007568.1007629
Full text: PDFPDF

Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's domain of interest, and semantic relationships between peers are provided locally ...
expand
SESSION: Research sessions: security and privacy
Extending query rewriting techniques for fine-grained access control
Shariq Rizvi, Alberto Mendelzon, S. Sudarshan, Prasan Roy
Pages: 551-562
doi>10.1145/1007568.1007631
Full text: PDFPDF

Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views, to control which parts of the data can be accessed by each user. Fine-grained ...
expand
Order preserving encryption for numeric data
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikant, Yirong Xu
Pages: 563-574
doi>10.1145/1007568.1007632
Full text: PDFPDF

Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an order-preserving encryption scheme for numeric data that allows any comparison ...
expand
A formal analysis of information disclosure in data exchange
Gerome Miklau, Dan Suciu
Pages: 575-586
doi>10.1145/1007568.1007633
Full text: PDFPDF

We perform a theoretical study of the following query-view security problem: given a view V to be published, does V logically disclose information about a confidential query S? The problem is motivated by the need to manage ...
expand
Secure XML querying with security views
Wenfei Fan, Chee-Yong Chan, Minos Garofalakis
Pages: 587-598
doi>10.1145/1007568.1007634
Full text: PDFPDF

The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing sensitive information unauthorized users. This paper introduces a novel ...
expand
SESSION: Research sessions: moving objects
Indexing spatio-temporal trajectories with Chebyshev polynomials
Yuhan Cai, Raymond Ng
Pages: 599-610
doi>10.1145/1007568.1007636
Full text: PDFPDF

In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose the polynomial, including (continuous)Fourier transforms, ...
expand
Prediction and indexing of moving objects with unknown motion patterns
Yufei Tao, Christos Faloutsos, Dimitris Papadias, Bin Liu
Pages: 611-622
doi>10.1145/1007568.1007637
Full text: PDFPDF

Existing methods for peediction spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice movement is more complex, and individual objects may follow drastically diffferent ...
expand
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
Mohamed F. Mokbel, Xiaopeing Xiong, Walid G. Aref
Pages: 623-634
doi>10.1145/1007568.1007638
Full text: PDFPDF

This paper intoduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluting a set of concurrent continuous spatio-temporal queries. SINA is designed with two goals in mind: (1) Scalability in terms of the ...
expand
STRIPES: an efficient index for predicted trajectories
Jignesh M. Patel, Yun Chen, V. Prasad Chakka
Pages: 635-646
doi>10.1145/1007568.1007639
Full text: PDFPDF

Moving object databases are required to support queries on a large number of continuously moving objects. A key requirement for indexing methods in this domain is to efficiently support both update and query operations. Previous work on indexing such ...
expand
SESSION: Research sessions: query optimization
CORDS: automatic discovery of correlations and soft functional dependencies
Ihab F. Ilyas, Volker Markl, Peter Haas, Paul Brown, Ashraf Aboulnaga
Pages: 647-658
doi>10.1145/1007568.1007641
Full text: PDFPDF

The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers---which usually assume that columns are statistically independent---to underestimate the selectivities ...
expand
Robust query processing through progressive optimization
Volker Markl, Vijayshankar Raman, David Simmen, Guy Lohman, Hamid Pirahesh, Miso Cilimdzic
Pages: 659-670
doi>10.1145/1007568.1007642
Full text: PDFPDF

Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation errors can occur due to the use of inaccurate statistics, invalid assumptions ...
expand
Canonical abstraction for outerjoin optimization
Jun Rao, Hamid Pirahesh, Calisto Zuzarte
Pages: 671-682
doi>10.1145/1007568.1007643
Full text: PDFPDF

Outerjoins are an important class of joins and are widely used in various kinds of applications. It is challenging to optimize queries that contain outerjoins because outerjoins do not always commute with inner joins. Previous work has studied this problem ...
expand
SESSION: Research sessions: spatial data
Joining interval data in relational databases
Jost Enderle, Matthias Hampel, Thomas Seidl
Pages: 683-694
doi>10.1145/1007568.1007645
Full text: PDFPDF

The increasing use of temporal and spatial data in present-day relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms do not support those data types adequately, whereas special approaches ...
expand
Approximation techniques for spatial data
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
Pages: 695-706
doi>10.1145/1007568.1007646
Full text: PDFPDF

Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high query processing costs. Accurate selectivity estimation during query optimization ...
expand
Spatially-decaying aggregation over a network: model and algorithms
Edith Cohen, Haim Kaplan
Pages: 707-718
doi>10.1145/1007568.1007647
Full text: PDFPDF

Data items are often associated with a location in which they are present or collected, and their relevance or influence decays with their distance. Aggregate values over such data thus depend on the observing location, where the weight given to each ...
expand
SESSION: Research sessions: schema discovery
TOSS: an extension of TAX with ontologies and similarity queries
Edward Hung, Yu Deng, V. S. Subrahmanian
Pages: 719-730
doi>10.1145/1007568.1007649
Full text: PDFPDF

TAX is perhaps the best known extension of the relational algebra to handle queries to XML databases. One problem with TAX (as with many existing relational DBMSs) is that the semantics of terms in a TAX DB are not taken into account when answering queries. ...
expand
Information-theoretic tools for mining database structure from large data sets
Periklis Andritsos, Renée J. Miller, Panayiotis Tsaparas
Pages: 731-742
doi>10.1145/1007568.1007650
Full text: PDFPDF

Data design has been characterized as a process of arriving at a design that maximizes the information content of each piece of data (or equivalently, one that minimizes redundancy). Information content (or redundancy) is measured with respect to a prescribed ...
expand
SESSION: Research sessions: query uncertainty
Efficient set joins on similarity predicates
Sunita Sarawagi, Alok Kirpal
Pages: 743-754
doi>10.1145/1007568.1007652
Full text: PDFPDF

In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coefficient, cosine similarity, and edit-distance. This expands the existing ...
expand
Automatic categorization of query results
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won Hwang
Pages: 755-766
doi>10.1145/1007568.1007653
Full text: PDFPDF

Exploratory ad-hoc queries could return too many answers - a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically categorize the results of SQL queries to address this problem. We dynamically generate ...
expand
SESSION: Research sessions: text and DB
When one sample is not enough: improving text database selection using shrinkage
Panagiotis G. Ipeirotis, Luis Gravano
Pages: 767-778
doi>10.1145/1007568.1007655
Full text: PDFPDF

Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the database contents, which are not typically exported by databases. Previous research ...
expand
On the integration of structure indexes and inverted lists
Raghav Kaushik, Rajasekar Krishnamurthy, Jeffrey F. Naughton, Raghu Ramakrishnan
Pages: 779-790
doi>10.1145/1007568.1007656
Full text: PDFPDF

Several methods have been proposed to evaluate queries over a native XML DBMS, where the queries specify both path and keyword constraints. These broadly consist of graph traversal approaches, optimized with auxiliary structures known as structure indexes; ...
expand
SESSION: Research sessions: query progress
Toward a progress indicator for database queries
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael W. Watzke
Pages: 791-802
doi>10.1145/1007568.1007658
Full text: PDFPDF

Many modern software systems provide progress indicators for long-running tasks. These progress indicators make systems more user-friendly by helping the user quickly estimate how much of the task has been completed and when the task will finish. However, ...
expand
Estimating progress of execution for SQL queries
Surajit Chaudhuri, Vivek Narasayya, Ravishankar Ramamurthy
Pages: 803-814
doi>10.1145/1007568.1007659
Full text: PDFPDF

Today's database systems provide little feedback to the user/DBA on how much of a SQL query's execution has been completed. For long running queries, such feedback can be very useful, for example, to help decide whether the query should be terminated ...
expand
SESSION: Research sessions: consistency and availability
Relaxed currency and consistency: how to say "good enough" in SQL
Hongfei Guo, Per-Åke Larson, Raghu Ramakrishnan, Jonathan Goldstein
Pages: 815-826
doi>10.1145/1007568.1007661
Full text: PDFPDF

Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applications are written with some understanding of which queries can use data that ...
expand
Highly available, fault-tolerant, parallel dataflows
Mehul A. Shah, Joseph M. Hellerstein, Eric Brewer
Pages: 827-838
doi>10.1145/1007568.1007662
Full text: PDFPDF

We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to implement a variety of continuous query (CQ) applications that require high-throughput, ...
expand
SESSION: Industrial sessions: database internals - I
Query sampling in DB2 Universal Database
Jarek Gryz, Junjie Guo, Linqi Liu, Calisto Zuzarte
Pages: 839-843
doi>10.1145/1007568.1007664
Full text: PDFPDF

Executing ad hoc queries against large databases can be prohibitively expensive. Exploratory analysis of data may not require exact answers to queries, however: results based on sampling the data are often satisfactory. Supporting sampling as a primitive ...
expand
Query processing for SQL updates
César A. Galindo-Legaria, Stefano Stefani, Florian Waas
Pages: 844-849
doi>10.1145/1007568.1007665
Full text: PDFPDF

A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused on issues related to data-retrieval queries, with a strong backing on ...
expand
Parallel SQL execution in Oracle 10g
Thierry Cruanes, Benoit Dageville, Bhaskar Ghosh
Pages: 850-854
doi>10.1145/1007568.1007666
Full text: PDFPDF

This paper describes the new architecture and optimizations for parallel SQL execution in the Oracle 10g database. Based on the fundamental shared-disk architecture underpinning Oracle's parallel SQL execution engine since Oracle7, we show in this paper ...
expand
SESSION: Industrial sessions: database internals - II
Data densification in a relational database system
Abhinav Gupta, Sankar Subramanian, Srikanth Bellamkonda, Tolga Bozkaya, Nathan Folkert, Lei Sheng, Andrew Witkowski
Pages: 855-859
doi>10.1145/1007568.1007668
Full text: PDFPDF

Data in a relational data warehouse is usually sparse. That is, if no value exists for a given combination of dimension values, no row exists in the fact table. Densities of 0.1-2% are very common. However, users may want to view the data in a dense ...
expand
Hosting the .NET Runtime in Microsoft SQL server
Alazel Acheson, Mason Bendixen, José A. Blakeley, Peter Carlin, Ebru Ersan, Jun Fang, Xiaowei Jiang, Christian Kleinerman, Balaji Rathakrishnan, Gideon Schaller, Beysim Sezgin, Ramachandran Venkatesh, Honggang Zhang
Pages: 860-865
doi>10.1145/1007568.1007669
Full text: PDFPDF

The integration of the .NET Common Language Runtime (CLR) inside the SQL Server DBMS enables database programmers to write business logic in the form of functions, stored procedures, triggers, data types, and aggregates using modern programming languages ...
expand
Vertical and horizontal percentage aggregations
Carlos Ordonez
Pages: 866-871
doi>10.1145/1007568.1007670
Full text: PDFPDF

Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such limitations. The first function returns one row for each percentage in vertical ...
expand
SESSION: Industrial sessions: Web Services
Models for Web Services tansactions
Mark Little
Pages: 872-872
doi>10.1145/1007568.1007672
Full text: PDFPDF
Enabling sovereign information sharing using Web Services
Rakesh Agrawal, Dmitri Asonov, Ramakrishnan Srikant
Pages: 873-877
doi>10.1145/1007568.1007673
Full text: PDFPDF

Sovereign information sharing allows autonomous entities to compute queries across their databases in such a way that nothing apart from the result is revealed. We describe an implementation of this model using web services infrastructure. Each site ...
expand
Building dynamic application networks with Web Services
Matthew Mihic
Pages: 878-878
doi>10.1145/1007568.1007674
Full text: PDFPDF

Looking at the state of the industry today, it is clear that we are in the early stages of Web Services development. Companies are still evaluating what the technology and considering how to apply it to their business. But over the past year, we seem ...
expand
Secure, reliable, transacted: innovation in Web Services architecture
Martin Gudgin
Pages: 879-880
doi>10.1145/1007568.1007675
Full text: PDFPDF

This paper discusses the design of Web Services Protocols paying special attention to composition of such protocols. The transaction related protocols are discussed as exemplars.
expand
SESSION: Industrial sessions: database applications
SoundCompass: a practical query-by-humming system; normalization of scalable and shiftable time-series data and effective subsequence generation
Naoko Kosugi, Yasushi Sakurai, Masashi Morimoto
Pages: 881-886
doi>10.1145/1007568.1007677
Full text: PDFPDF

This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techniques employed by SoundCompass such as normalization in a time-wise ...
expand
Model-driven business UI based on maps
Per Bendsen
Pages: 887-891
doi>10.1145/1007568.1007678
Full text: PDFPDF

Future business applications will often have more than 2,000 forms and need to target several user interface (UI) technologies including: Web Browsers, Windows® Applications, PDA's, and cell phones. The applications will need state-of-the-art layout ...
expand
dbSwitch™: towards a database utility
Shaul Dar, Gil Hecht, Eden Shochat
Pages: 892-896
doi>10.1145/1007568.1007679
Full text: PDFPDF

Savantis Systems' dbSwitch™ is an innovative commercial product providing database server virtualization and advancing a database utility model. The dbSwitch enables a new architecture, called a Database Area Network (DAN), which pools database ...
expand
SESSION: Industrial sessions: information assurance challenges
Requirements and policy challenges in highly secure environments
Dean E. Hall
Pages: 897-898
doi>10.1145/1007568.1007681
Full text: PDFPDF
Information assurance technical challenges
Nicholas J. Multari
Pages: 899-899
doi>10.1145/1007568.1007682
Full text: PDFPDF
Service-oriented BI: towards tight integration of business intelligence into operational applications
Marcus Dill, Achim Kraiss, Stefan Sigg, Thomas Zurek
Pages: 900-900
doi>10.1145/1007568.1007683
Full text: PDFPDF
SESSION: Industrial sessions: the marriage of XML and relational databases
XML in the middle: XQuery in the WebLogic Platform
Michael J. Carey
Pages: 901-902
doi>10.1145/1007568.1007685
Full text: PDFPDF

The BEA WebLogic Platform product suite consists of WebLogic Server, WebLogic Workshop, WebLogic Integration, WebLogic Portal, and Liquid Data for WebLogic. W3C standards including XML, XML Schema, and the emerging XML query language XQuery play important ...
expand
ORDPATHs: insert-friendly XML node labels
Patrick O'Neil, Elizabeth O'Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, Nigel Westbury
Pages: 903-908
doi>10.1145/1007568.1007686
Full text: PDFPDF

We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft® SQL Server™. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case---a schema simplifies the ...
expand
DEMONSTRATION SESSION: Web services
Declarative specification of Web applications exploiting Web services and workflows
Marco Brambilla, Stefano Ceri, Sara Comai, Marco Dario, Piero Fraternali, Ioana Manolescu
Pages: 909-910
doi>10.1145/1007568.1007688
Full text: PDFPDF

This demo presents an extension of a declarative language for specifying data-intensive Web applications. We demonstrate a scenario extracted from a real-life application, the Web portal of a computer manufacturer, including interactions with third-party ...
expand
Yoo-Hoo!: building a presence service with XQuery and WSDL
Mary Fernández, Nicola Onose, Jérôme Siméon
Pages: 911-912
doi>10.1145/1007568.1007689
Full text: PDFPDF
DEMONSTRATION SESSION: Data integration
Knocking the door to the deep Web: integrating Web query interfaces
Bin He, Zhen Zhang, Kevin Chen-Chuan Chang
Pages: 913-914
doi>10.1145/1007568.1007691
Full text: PDFPDF
Efficient development of data migration transformations
Paulo Carreira, Helena Galhardas
Pages: 915-916
doi>10.1145/1007568.1007692
Full text: PDFPDF

In this paper, we present a data migration tool named DATA FUSION. Its main features are: A domain specific language designed to conveniently model complex data transformations; an integrated development environment that assists users on managing complex ...
expand
Liquid data for WebLogic: integrating enterprise data and services
Vinayak Borkar
Pages: 917-918
doi>10.1145/1007568.1007693
Full text: PDFPDF

Information in today's enterprises commonly resides in a variety of heterogeneous data sources, including relational databases, web services, files, packaged applications, and custom data repositories. BEA's enterprise information integration product, ...
expand
DEMONSTRATION SESSION: Data mining
MAIDS: mining alarming incidents from data streams
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han, Michael Welge, Loretta Auvil
Pages: 919-920
doi>10.1145/1007568.1007695
Full text: PDFPDF
FAÇADE: a fast and effective approach to the discovery of dense clusters in noisy spatial data
Yu Qian, Gang Zhang, Kang Zhang
Pages: 921-922
doi>10.1145/1007568.1007696
Full text: PDFPDF

FAÇADE (Fast and Automatic Clustering Approach to Data Engineering) is a spatial clustering tool that can discover clusters of different sizes, shapes, and densities in noisy spatial data. Compared with the existing clustering methods, FAÇADE ...
expand
DataMIME™
Masum Serazi, Vasily Malakhov, Dongmei Ren, Amal Perera, Imad Rahal, Weihua Wu, Qiang Ding, Fei Pan, William Perrizo
Pages: 923-924
doi>10.1145/1007568.1007697
Full text: PDFPDF
DEMONSTRATION SESSION: Streams
PIPES: a public infrastructure for processing and exploring streams
Jürgen Krämer, Bernhard Seeger
Pages: 925-926
doi>10.1145/1007568.1007699
Full text: PDFPDF

PIPES is a flexible and extensible infrastructure providing fundamental building blocks to implement a data stream management system (DSMS). It is seamlessly integrated into the Java library XXL [1, 2, 3] for advanced query processing and extends XXL's ...
expand
Web-CAM: monitoring the dynamic Web to respond to continual queries
Shaveen Garg, Krithi Ramamritham, Soumen Chakrabarti
Pages: 927-928
doi>10.1145/1007568.1007700
Full text: PDFPDF
Load management and high availability in the Medusa distributed stream processing system
Magdalena Balazinska, Hari Balakrishnan, Michael Stonebraker
Pages: 929-930
doi>10.1145/1007568.1007701
Full text: PDFPDF

Medusa [3, 6] is a distributed stream processing system based on the Aurora single-site stream processing engine [1]. We demonstrate how Medusa handles time-varying load spikes and provides high availability in the face of network partitions. We demonstrate ...
expand
StreaMon: an adaptive engine for stream query processing
Shivnath Babu, Jennifer Widom
Pages: 931-932
doi>10.1145/1007568.1007702
Full text: PDFPDF

StreaMon is the adaptive query processing engine of the STREAM prototype Data Stream Management System (DSMS) [4]. A fundamental challenge in many DSMS applications (e.g., network monitoring, financial monitoring over stock tickers, ...
expand
DEMONSTRATION SESSION: Peer-to-peer and distributed databases
P2P-DIET: an extensible P2P service that unifies ad-hoc and continuous querying in super-peer networks
Stratos Idreos, Manolis Koubarakis, Christos Tryfonopoulos
Pages: 933-934
doi>10.1145/1007568.1007704
Full text: PDFPDF
Querying at Internet scale
Brent Chun, Joseph M. Hellerstein, Ryan Huebsch, Shawn R. Jeffery, Boon Thau Loo, Sam Mardanbeigi, Timothy Roscoe, Sean Rhea, Scott Shenker, Ion Stoica
Pages: 935-936
doi>10.1145/1007568.1007705
Full text: PDFPDF

We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, reliability, decentralized ...
expand
Support for relaxed currency and consistency constraints in MTCache
Hongfei Guo, Per-Åke Larson, Raghu Ramakrishnan, Jonathan Goldstein
Pages: 937-938
doi>10.1145/1007568.1007706
Full text: PDFPDF
An indexing framework for peer-to-peer systems
Adina Crainiceanu, Prakash Linga, Ashwin Machanavajjhala, Johannes Gehrke, Jayavel Shanmugasundaram
Pages: 939-940
doi>10.1145/1007568.1007707
Full text: PDFPDF
DEMONSTRATION SESSION: XML
XSeq: an indexing infrastructure for tree pattern queries
Xiaofeng Meng, Yu Jiang, Yan Chen, Haixun Wang
Pages: 941-942
doi>10.1145/1007568.1007709
Full text: PDFPDF

Given a tree-pattern query, most XML indexing approaches decompose it into multiple sub-queries, and then join their results to provide the answer to the original query. Join operations have been identified as the most time-consuming component in XML ...
expand
A TeXQuery-based XML full-text search engine
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugasundaram
Pages: 943-944
doi>10.1145/1007568.1007710
Full text: PDFPDF

We demonstrate an XML full-text search engine that implements the TeXQuery language. TeXQuery is a powerful full-text search extension to XQuery that provides a rich set of fully composable full-text primitives, such as phrase matching, proximity ...
expand
DEMONSTRATION SESSION: Data privacy
"Share your data, keep your secrets."
Irini Fundulaki, Arnaud Sahuguet
Pages: 945-946
doi>10.1145/1007568.1007712
Full text: PDFPDF
Managing healthcare data hippocratically
Rakesh Agrawal, Ameet Kini, Kristen LeFevre, Amy Wang, Yirong Xu, Diana Zhou
Pages: 947-948
doi>10.1145/1007568.1007713
Full text: PDFPDF
DEMONSTRATION SESSION: Potpourri
LexEQUAL: multilexical matching operator in SQL
A. Kumaran, Jayant R. Haritsa
Pages: 949-950
doi>10.1145/1007568.1007715
Full text: PDFPDF
ITQS: an integrated transport query system
B. Huang, Z. Huang, H. Li, D. Lin, H. Lu, Y. Song
Pages: 951-952
doi>10.1145/1007568.1007716
Full text: PDFPDF
BODHI: a database habitat for bio-diversity information
Srikanta J. Bedathur, Abhijit Kadlag, Jayant R. Haritsa
Pages: 953-954
doi>10.1145/1007568.1007717
Full text: PDFPDF
CAMAS: a citizen awareness system for crisis mitigation
Sharad Mehrotra, Carter Butts, Dmitri V. Kalashnikov, Nalini Venkatasubramanian, Kemal Altintas, Ram Hariharan, Haimin Lee, Yiming Ma, Amnon Myers, Jehan Wickramasuriya, Ron Eguchi, Charles Huyck
Pages: 955-956
doi>10.1145/1007568.1007718
Full text: PDFPDF
PANEL SESSION: Panel
Christian S. Jensen
Rethinking the conference reviewing process
Michael J. Franklin, Jennifer Widom, Anastassia Ailamaki, Philip A. Bernstein, David DeWitt, Alon Halevy, Zachary Ives, Gerhard Weikum
Pages: 957-957
doi>10.1145/1007568.1007720
Full text: PDFPDF
TUTORIAL SESSION: Tutorial 1
Tools for design of composite Web services
Richard Hull, Jianwen Su
Pages: 958-961
doi>10.1145/1007568.1007722
Full text: PDFPDF
TUTORIAL SESSION: Tutorial 2
Security of shared data in large systems: state of the art and research directions
Arnon Rosenthal, Marianne Winslett
Pages: 962-964
doi>10.1145/1007568.1007724
Full text: PDFPDF

The target audience for this tutorial is the entire SIGMOD research community. The goals of the tutorial are to enlighten the SIGMOD research community about the state of the art in data security, especially for enterprise or larger systems, and ...
expand
TUTORIAL SESSION: Tutorial 3
Fast algorithms for time series with applications to finance, physics, music, biology, and other suspects
Alberto Lerner, Dennis Shasha, Zhihua Wang, Xiaojian Zhao, Yunyue Zhu
Pages: 965-968
doi>10.1145/1007568.1007726
Full text: PDFPDF

Financial time series streams are watched closely by millions of traders. What exactly do they look for and how can we help them do it faster? Physicists study the time series emerging from their sensors. The same question holds for them. Musicians produce ...
expand
TUTORIAL SESSION: Tutorial 4
Indexing and mining streams
Christos Faloutsos
Pages: 969-969
doi>10.1145/1007568.1007728
Full text: PDFPDF

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Reader    QuickTime    Windows Media Player    Real Player
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder