Search For:

Displaying 1-43 out of 43 total
Declarative networking
Found in: Communications of the ACM
By Boon Thau Loo, David E. Gay, David E. Gay, David E. Gay, Ion Stoica, Ion Stoica, Ion Stoica, Joseph M. Hellerstein, Joseph M. Hellerstein, Joseph M. Hellerstein, Minos Garofalakis, Minos Garofalakis, Minos Garofalakis, Petros Maniatis, Petros Maniatis, Petros Maniatis, Raghu Ramakrishnan, Raghu Ramakrishnan, Raghu Ramakrishnan, Timothy Roscoe, Timothy Roscoe, Timothy Roscoe, Tyson Condie, Tyson Condie, Tyson Condie
Issue Date:November 2009
pp. 87-95
Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. This paper provides an introduction to ba...
     
Guest Editors' Introduction: Special Section on Mining Large Uncertain and Probabilistic Databases
Found in: IEEE Transactions on Knowledge and Data Engineering
By Reynold Cheng, Michael Chau, Minos Garofalakis, Jeffrey Xu Yu
Issue Date:September 2010
pp. 1201-1202
No summary available.
 
Granularity Conscious Modeling for Probabilistic Databases
Found in: Data Mining Workshops, International Conference on
By Eirinaios Michelakis, Daisy Zhe Wang, Minos Garofalakis, Joseph M. Hellerstein
Issue Date:October 2007
pp. 501-506
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially ? and of- ten inaccurately ? capture the state of the world. Reasoning about uncertainty as a fi...
 
Communication-Efficient Tracking of Distributed Cumulative Triggers
Found in: Distributed Computing Systems, International Conference on
By Ling Huang, Minos Garofalakis, Anthony D. Joseph, Nina Taft
Issue Date:June 2007
pp. 54
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amount of data from distributed monitors. In this paper, we expand our previous ...
 
Selectivity Estimation for XML Twigs
Found in: Data Engineering, International Conference on
By Neoklis Polyzotis, Minos Garofalakis, Yannis Ioannidis
Issue Date:April 2004
pp. 264
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of element tuples based on the intertwined evaluation (i.e., join) of multiple pat...
 
Scalable Filtering of XML Data for Web Services
Found in: IEEE Internet Computing
By Pascal Felber, Chee-Yong Chan, Minos Garofalakis, Rajeev Rastogi
Issue Date:January 2003
pp. 49-57
<p>Scalable content-based routing architectures for Web applications can handle the growing number of XML messages associated with Web services.</p>
 
Efficient Filtering of XML Documents with XPath Expressions
Found in: Data Engineering, International Conference on
By Chee-Yong Chan, Pascal Felber, Minos Garofalakis, Rajeev Rastogi
Issue Date:March 2002
pp. 0235
We propose a novel index structure, termed XTrie, that supports the efficient filtering of XML documents based on XPath expressions. Our XTrie index structure offers several novel features that make it especially attractive for large-scale publish/subscrib...
 
Histograms and Wavelets on Probabilistic Data
Found in: IEEE Transactions on Knowledge and Data Engineering
By Graham Cormode, Minos Garofalakis
Issue Date:August 2010
pp. 1142-1157
There is a growing realization that uncertain information is a first-class citizen in modern database management. As such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data reduction techniques ...
 
Probabilistic declarative information extraction
Found in: Data Engineering, International Conference on
By Daisy Zhe Wang, Eirinaios Michelakis, Michael J. Franklin, Minos Garofalakis, Joseph M. Hellerstein
Issue Date:March 2010
pp. 173-176
Unstructured text represents a large fraction of the world's data. It often contains snippets of structured information (e.g., people's names and zip codes). Information Extraction (IE) techniques identify such structured information in text. In recent yea...
 
Histograms and Wavelets on Probabilistic Data
Found in: Data Engineering, International Conference on
By Graham Cormode, Minos Garofalakis
Issue Date:April 2009
pp. 293-304
There is a growing realization that uncertain information is a first-class citizen in modern database management. As such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data reduction techniques ...
 
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks
Found in: Distributed Computing Systems, International Conference on
By Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi, Krishan Sabnani
Issue Date:June 2007
pp. 4
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today?s Internet as a viable commercial and business tool. In this paper, we propose novel data-streaming al...
 
Proof Sketches: Verifiable In-Network Aggregation
Found in: Data Engineering, International Conference on
By Minos Garofalakis, Joseph M. Hellerstein, Petros Maniatis
Issue Date:April 2007
pp. 996-1005
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In this paper we present a first step towards verifiable yet efficient distribu...
 
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
Found in: Data Engineering, International Conference on
By Raphael Chand, Pascal Felber, Minos Garofalakis
Issue Date:April 2007
pp. 1016-1025
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important challenge. Content-based publish/subscribe systems offer a convenient design...
 
XCluster Synopses for Structured XML Content
Found in: Data Engineering, International Conference on
By Neoklis Polyzotis, Minos Garofalakis
Issue Date:April 2006
pp. 63
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a novel XML-summarization model, termed XCLUSTERs, that enables accurate selectivi...
 
Continuous fragmented skylines over distributed streams
Found in: 2014 IEEE 30th International Conference on Data Engineering (ICDE)
By Odysseas Papapetrou,Minos Garofalakis
Issue Date:March 2014
pp. 124-135
Distributed skyline computation is important for a wide range of application domains, from distributed and web-based systems to ISP-network monitoring and distributed databases. The problem is particularly challenging in dynamic distributed settings, where...
   
Hybrid in-database inference for declarative information extraction
Found in: Proceedings of the 2011 international conference on Management of data (SIGMOD '11)
By Daisy Zhe Wang, Joseph M. Hellerstein, Michael J. Franklin, Michael L. Wick, Minos Garofalakis
Issue Date:June 2011
pp. 517-528
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in the IE process in a scalable manner. Recent work has proposed a probabilistic d...
     
Approximate continuous querying over distributed streams
Found in: ACM Transactions on Database Systems (TODS)
By Graham Cormode,Minos Garofalakis
Issue Date:June 2008
pp. 1-39
While traditional database systems optimize for performance on one-shot query processing, emerging large-scale monitoring applications require continuous tracking of complex data-analysis queries over collections of physically distributed streams. Thus, ef...
     
Streaming in a connected world: querying and tracking distributed data streams
Found in: Proceedings of the 11th international conference on Extending database technology: Advances in database technology (EDBT '08)
By Graham Cormode, Minos Garofalakis
Issue Date:March 2008
pp. 1-3
Today, a majority of data is fundamentally distributed in nature. Data for almost any task is collected over a broad area, and streams in at a much greater rate than ever before. In particular, advances in sensor technology and miniaturization have led to ...
     
Streaming in a connected world: querying and tracking distributed data streams
Found in: Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07)
By Graham Cormode, Minos Garofalakis
Issue Date:June 2007
pp. 1178-1181
Recent advances in device technology and connectivity have paved the way for next generation applications that are data-driven, whose data can reside anywhere, can be accessed at any time, from any client. Also, advances in memory technology are driving th...
     
Sharing aggregate computation for distributed queries
Found in: Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07)
By Ion Stoica, Joseph M. Hellerstein, Minos Garofalakis, Ryan Huebsch
Issue Date:June 2007
pp. 485-496
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be infeasible, so multi-query optimizations are critical for sharing work across ...
     
Sketching probabilistic data streams
Found in: Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07)
By Graham Cormode, Minos Garofalakis
Issue Date:June 2007
pp. 281-292
The management of uncertain, probabilistic data has recently emerged as a useful paradigm for dealing with the inherent unreliabilities of several real-world application domains, including data cleaning, information integration, and pervasive, multi-sensor...
     
Extended wavelets for multiple measures
Found in: ACM Transactions on Database Systems (TODS)
By Antonios Deligiannakis, Minos Garofalakis, Nick Roussopoulos
Issue Date:June 2007
pp. 10-es
Several studies have demonstrated the effectiveness of the Haar wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate approximate answers to user queries. Although orig...
     
Distributed sparse random projections for refinable approximation
Found in: Proceedings of the 6th international conference on Information processing in sensor networks (IPSN '07)
By Kannan Ramchandran, Minos Garofalakis, Wei Wang
Issue Date:April 2007
pp. 331-339
Consider a large-scale wireless sensor network measuring compressible data, where n distributed data values can be well-approximated using only k « n coefficients of some known transform. We address the problem of recovering an approximation of the n ...
     
XSKETCH synopses for XML data graphs
Found in: ACM Transactions on Database Systems (TODS)
By Minos Garofalakis, Neoklis Polyzotis
Issue Date:September 2006
pp. 1014-1063
Effective support for XML query languages is becoming increasingly important with the emergence of new applications that access large volumes of XML data. All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that ...
     
Toward sophisticated detection with distributed triggers
Found in: Proceedings of the 2006 SIGCOMM workshop on Mining network data (MineNet '06)
By Anthony Joseph, Joseph Hellerstein, Ling Huang, Minos Garofalakis, Nina Taft
Issue Date:September 2006
pp. 311-316
Recent research has proposed efficient protocols for distributed triggers, which can be used in monitoring infrastructures to maintain system-wide invariants and detect abnormal events with minimal communication overhead. To date, however, this work has be...
     
Declarative networking: language, execution and optimization
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Boon Thau Loo, David E. Gay, Ion Stoica, Joseph M. Hellerstein, Minos Garofalakis, Petros Maniatis, Raghu Ramakrishnan, Timothy Roscoe, Tyson Condie
Issue Date:June 2006
pp. 97-108
The networking and distributed systems communities have recently explored a variety of new network architectures, both for application-level overlay networks, and as prototypes for a next-generation Internet architecture. In this context, we have investiga...
     
Wavelet synopses for general error metrics
Found in: ACM Transactions on Database Systems (TODS)
By Amit Kumar, Minos Garofalakis
Issue Date:December 2005
pp. 888-928
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate approximate query answers. Conventional wavelet synopse...
     
Holistic aggregates in a networked world: distributed tracking of approximate quantiles
Found in: Proceedings of the 2005 ACM SIGMOD international conference on Management of data (SIGMOD '05)
By Graham Cormode, Minos Garofalakis, Rajeev Rastogi, S. Muthukrishnan
Issue Date:June 2005
pp. 25-36
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and data-distribution summaries over collections of physically-distributed strea...
     
Join-distinct aggregate estimation over update streams
Found in: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS '05)
By Amit Kumar, Minos Garofalakis, Rajeev Rastogi, Sumit Ganguly
Issue Date:June 2005
pp. 259-270
There is growing interest in algorithms for processing andquerying continuous data streams (i.e., data that is seenonly once in a fixed order) with limited memory resources.Providing (perhaps approximate) answers to queries over suchstreams is a crucial re...
     
XML stream processing using tree-edit distance embeddings
Found in: ACM Transactions on Database Systems (TODS)
By Amit Kumar, Minos Garofalakis
Issue Date:March 2005
pp. 279-332
We propose the first known solution to the problem of correlating, in small space, continuous streams of XML data through approximate (structure and content) matching, as defined by a general tree-edit distance metric. The key element of our solution is a ...
     
Composable XML integration grammars
Found in: Proceedings of the Thirteenth ACM conference on Information and knowledge management (CIKM '04)
By Ming Xiong, Minos Garofalakis, Wenfei Fan, Xibei Jia
Issue Date:November 2004
pp. 2-11
The proliferation of XML as a standard for data representation and exchange in diverse, next-generation Web applications has created an emphatic need for effective XML data-integration tools. For several real-life scenarios, such XML data integration needs...
     
Deterministic wavelet thresholding for maximum-error metrics
Found in: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS '04)
By Amit Kumar, Minos Garofalakis
Issue Date:June 2004
pp. 166-176
Several studies have demonstrated the effectiveness of the wavelet, decomposition as a tool for reducing large amounts of data down to compact, wavelet synopses that can be used to obtain fast, accurate approximate answers to user queries. While convention...
     
Secure XML querying with security views
Found in: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD '04)
By Chee-Yong Chan, Minos Garofalakis, Wenfei Fan
Issue Date:June 2004
pp. 587-598
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 parad...
     
Approximate XML query answers
Found in: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD '04)
By Minos Garofalakis, Neoklis Polyzotis, Yannis Ioannidis
Issue Date:June 2004
pp. 263-274
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 in...
     
Correlating XML data streams using tree-edit distance embeddings
Found in: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS '03)
By Amit Kumar, Minos Garofalakis
Issue Date:June 2003
pp. 143-154
We propose the first known solution to the problem of correlating, in small space, continuous streams of XML data through approximate (structure and content) matching, as defined by a general tree-edit distance metric. The key element of our solution is a ...
     
Querying and mining data streams: you only get one look a tutorial
Found in: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (SIGMOD '02)
By Johannes Gehrke, Minos Garofalakis, Rajeev Rastogi
Issue Date:June 2002
pp. 635-635
There are a number of database systems available free of charge for the research community, with complete access to the source code. Some of these systems result from completed research projects, others have been developed outside the research community. H...
     
Wavelet synopses with error guarantees
Found in: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (SIGMOD '02)
By Minos Garofalakis, Phillip B. Gibbons
Issue Date:June 2002
pp. 476-487
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopses") that can be used to provide fast and reasonably accurate approximate answers t...
     
Statistical synopses for graph-structured XML databases
Found in: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (SIGMOD '02)
By Minos Garofalakis, Neoklis Polyzotis
Issue Date:June 2002
pp. 358-369
Effective support for XML query languages is becoming increasingly important with the emergence of new applications that access large volumes of XML data. All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that ...
     
Processing complex aggregate queries over data streams
Found in: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (SIGMOD '02)
By Alin Dobra, Johannes Gehrke, Minos Garofalakis, Rajeev Rastogi
Issue Date:June 2002
pp. 61-72
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only limited memory. Providing (perhaps approximate) answers to queries over such...
     
SPARTAN: a model-based semantic compression system for massive data tables
Found in: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (SIGMOD '01)
By Minos Garofalakis, Rajeev Rastogi, Shivnath Babu
Issue Date:May 2001
pp. 256-266
While a variety of lossy compression schemes have been developed for certain forms of digital data (e.g., images, audio, video), the area of lossy compression techniques for arbitrary data tables has been left relatively unexplored. Nevertheless, such tech...
     
Independence is good: dependency-based histogram synopses for high-dimensional data
Found in: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (SIGMOD '01)
By Amol Deshpande, Minos Garofalakis, Rajeev Rastogi
Issue Date:May 2001
pp. 256-266
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical scenarios, including query optimization and approximate query answering. Exis...
     
Efficient algorithms for constructing decision trees with constraints
Found in: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '00)
By Dongjoon Hyun, Kyuseok Shim, Minos Garofalakis, Rajeev Rastogi
Issue Date:August 2000
pp. 335-339
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a difference to the effectiveness of information search. Today, Web surfers access the Web through two dominant inter...
     
XTRACT: a system for extracting document type descriptors from XML documents
Found in: Proceedings of the 2000 ACM SIGMOD international conference on Management of data (SIGMOD '00)
By Aristides Gionis, Kyuseok Shim, Minos Garofalakis, Rajeev Rastogi, S. Seshadri
Issue Date:May 2000
pp. 245-253
XML is rapidly emerging as the new standard for data representation and exchange on the Web. An XML document can be accompanied by a Document Type Descriptor (DTD) which plays the role of a schema for an XML data collection. DTDs contain valuable informati...
     
 1