Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2013
Automatic synthesis of out-of-core algorithms
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 133–144https://doi.org/10.1145/2463676.2465334We present a system for the automatic synthesis of efficient algorithms specialized for a particular memory hierarchy and a set of storage devices. The developer provides two independent inputs: 1) an algorithm that ignores memory hierarchy and external ...
- research-articleJune 2013
DBMS metrology: measuring query time
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 421–432https://doi.org/10.1145/2463676.2465331It is surprisingly hard to obtain accurate and precise measurements of the time spent executing a query. We review relevant process and overall measures obtainable from the Linux kernel and introduce a structural causal model relating these measures. A ...
- research-articleJune 2013
Efficient top-k algorithms for approximate substring matching
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 385–396https://doi.org/10.1145/2463676.2465324There is a wide range of applications that require to query a large database of texts to search for similar strings or substrings. Traditional approximate substring matching requests a user to specify a similarity threshold. Without top-k approximate ...
- research-articleJune 2013
On the correct and complete enumeration of the core search space
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 493–504https://doi.org/10.1145/2463676.2465314Reordering more than traditional joins (e.g. outerjoins, antijoins) requires some care, since not all reorderings are valid. To prevent invalid plans, two approaches have been described in the literature. We show that both approaches still produce ...
- research-articleJune 2013
Query processing on smart SSDs: opportunities and challenges
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1221–1230https://doi.org/10.1145/2463676.2465295Data storage devices are getting "smarter." Smart Flash storage devices (a.k.a. "Smart SSD") are on the horizon and will package CPU processing and DRAM storage inside a Smart SSD, and make that available to run user programs inside a Smart SSD. The ...
-
- research-articleJune 2013
Micro adaptivity in Vectorwise
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1231–1242https://doi.org/10.1145/2463676.2465292Performance of query processing functions in a DBMS can be affected by many factors, including the hardware platform, data distributions, predicate parameters, compilation method, algorithmic variations and the interactions between these. Given that ...
- research-articleJune 2013
Leveraging transitive relations for crowdsourced joins
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 229–240https://doi.org/10.1145/2463676.2465280The development of crowdsourced query processing systems has recently attracted a significant attention in the database community. A variety of crowdsourced queries have been investigated. In this paper, we focus on the crowdsourced join query which ...
- research-articleJune 2013
Branch-and-bound algorithm for reverse top-k queries
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 481–492https://doi.org/10.1145/2463676.2465278Top-k queries return to the user only the k best objects based on the individual user preferences and comprise an essential tool for rank-aware query processing. Assuming a stored data set of user preferences, reverse top-k queries have been introduced ...
- demonstrationJune 2013
Speeding up database applications with Pyxis
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 969–972https://doi.org/10.1145/2463676.2465265We propose to demonstrate Pyxis, a system that optimizes database applications by pushing computation to the database server. Our system applies program analysis techniques to the application source code to determine pieces of application logic that ...
- demonstrationJune 2013
Execution and optimization of continuous queries with cyclops
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1069–1072https://doi.org/10.1145/2463676.2465248As the data collected by enterprises grows in scale, there is a growing trend of performing data analytics on large datasets. Batch processing systems that can handle petabyte scale of data, such as Hadoop, have flourished and gained traction in the ...
- demonstrationJune 2013
SQUIN: a traversal based query execution system for the web of linked data
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1081–1084https://doi.org/10.1145/2463676.2465231The World Wide Web (WWW) currently evolves into a Web of Linked Data where content providers publish and link their data as they have done with hypertext for the last 20 years. We understand this emerging dataspace as a huge, distributed database which ...
- research-articleJune 2013
ε-Matching: event processing over noisy sequences in real time
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 601–612https://doi.org/10.1145/2463676.2463715Regular expression matching over sequences in real time is a crucial task in complex event processing on data streams. Given that such data sequences are often noisy and errors have temporal and spatial correlations, performing regular expression ...
- research-articleJune 2013
Parallel analytics as a service
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 25–36https://doi.org/10.1145/2463676.2463714Recently, massively parallel processing relational database systems (MPPDBs) have gained much momentum in the big data analytic market. With the advent of hosted cloud computing, we envision that the offering of MPPDB-as-a-Service (MPPDBaaS) will become ...
- research-articleJune 2013
Query containment in entity SQL
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1169–1172https://doi.org/10.1145/2463676.2463711We describe a software architecture we have developed for a constructive containment checker of Entity SQL queries defined over extended ER schemas expressed in Microsoft's Entity Data Model. Our application of interest is compilation of object-to-...
- research-articleJune 2013
Hekaton: SQL server's memory-optimized OLTP engine
- Cristian Diaconu,
- Craig Freedman,
- Erik Ismert,
- Per-Ake Larson,
- Pravin Mittal,
- Ryan Stonecipher,
- Nitin Verma,
- Mike Zwilling
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1243–1254https://doi.org/10.1145/2463676.2463710Hekaton is a new database engine optimized for memory resident data and OLTP workloads. Hekaton is fully integrated into SQL Server; it is not a separate system. To take advantage of Hekaton, a user simply declares a table memory optimized. Hekaton ...
- research-articleJune 2013
Split query processing in polybase
- David J. DeWitt,
- Alan Halverson,
- Rimma Nehme,
- Srinath Shankar,
- Josep Aguilar-Saborit,
- Artin Avanes,
- Miro Flasza,
- Jim Gramling
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1255–1266https://doi.org/10.1145/2463676.2463709This paper presents Polybase, a feature of SQL Server PDW V2 that allows users to manage and query data stored in a Hadoop cluster using the standard SQL query language. Unlike other database systems that provide only a relational view over HDFS-...
- research-articleJune 2013
CS2: a new database synopsis for query estimation
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 469–480https://doi.org/10.1145/2463676.2463701Fast and accurate estimations for complex queries are profoundly beneficial for large databases with heavy workloads. In this research, we propose a statistical summary for a database, called CS2 (Correlated Sample Synopsis), to provide rapid and ...
- research-articleJune 2013
MESSIAH: missing element-conscious SLCA nodes search in XML data
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 37–48https://doi.org/10.1145/2463676.2463699Keyword search for smallest lowest common ancestors (SLCAs) in XML data has been widely accepted as a meaningful way to identify matching nodes where their subtrees contain an input set of keywords. Although SLCA and its variants (e.g.,MLCA) perform ...
- demonstrationJune 2013
StreamWorks: a system for dynamic graph search
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1101–1104https://doi.org/10.1145/2463676.2463697Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a ...
- demonstrationJune 2013
Query processing on prefix trees live
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataJune 2013, Pages 1105–1108https://doi.org/10.1145/2463676.2463682Modern database systems have to process huge amounts of data and should provide results with low latency at the same time. To achieve this, data is nowadays typically hold completely in main memory, to benefit of its high bandwidth and low access ...